Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 17, 2026 22:43zielajzielajScore: 3,518Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 22:573,49355,431,40426,992,0001,999,0002,265,088
2Mar 17, 2026 22:573,50456,216,39827,079,0002,005,0002,519,040
3Mar 17, 2026 22:433,51852,178,44827,187,0002,013,0002,523,136
4Mar 17, 2026 22:433,51854,217,64527,187,0002,013,0002,441,216
5Mar 17, 2026 22:433,52851,386,60427,266,0002,019,0002,486,272
6Mar 17, 2026 22:573,53453,840,58027,312,0002,023,0002,437,120