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 14, 2026 22:44wnwnScore: 4,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:444,27356,851,16334,454,0001,013,0002,527,232
2Mar 14, 2026 22:444,27455,814,77634,458,0001,013,0002,273,280
3Mar 14, 2026 22:444,27462,568,08834,464,0001,013,0002,486,272
4Mar 14, 2026 22:444,28657,826,54134,554,0001,016,0002,486,272
5Mar 14, 2026 22:444,29965,260,23134,662,0001,019,0002,490,368
6Mar 14, 2026 22:444,32460,373,66933,899,0001,994,0002,273,280