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 8, 2026 19:18wnwnScore: 4,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 19:184,32062,118,27333,867,0001,992,0002,490,368
2Mar 8, 2026 19:184,34356,893,98534,048,0002,002,0002,273,280
3Mar 8, 2026 19:234,35256,860,97834,117,0002,006,0002,273,280
4Mar 8, 2026 19:184,36064,913,17834,180,0002,010,0002,527,232
5Mar 8, 2026 19:184,36860,987,00134,238,0002,014,0002,273,280
6Mar 8, 2026 19:184,39462,661,55735,461,0001,013,0002,527,232
7Mar 8, 2026 19:184,39456,430,21335,459,0001,013,0002,531,328
8Mar 8, 2026 19:234,39460,100,09535,455,0001,013,0002,273,280
9Mar 8, 2026 19:234,93266,075,97938,942,0001,997,0002,494,464