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 listApr 1, 2026 20:41leoweleoweScore: 61,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:4161,152539,647,300448,613,00058,949,0002,281,472
2Apr 1, 2026 20:4161,183533,092,626453,839,00053,980,0002,523,136
3Apr 1, 2026 20:4161,202530,319,661439,983,00067,997,0002,265,088
4Apr 1, 2026 20:4161,206536,520,995445,009,00063,001,0002,289,664
5Apr 1, 2026 20:4161,219531,185,203445,105,00063,014,0002,281,472
6Apr 1, 2026 20:4161,247537,150,081446,307,00062,042,0002,281,472
7Apr 1, 2026 20:4161,253535,671,455446,352,00062,049,0002,371,584
8Apr 1, 2026 20:4161,355533,140,625443,217,00066,032,0002,269,184
9Apr 1, 2026 20:4161,368537,944,569445,310,00064,044,0002,289,664