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 listMay 10, 2026 13:37wnwnScore: 3,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:373,26835,918,20427,128,00002,113,536
2May 10, 2026 13:373,28435,943,21127,261,00002,113,536
3May 10, 2026 13:373,31234,621,16227,497,00002,113,536
4May 10, 2026 13:373,32634,861,40326,588,0001,023,0002,113,536
5May 10, 2026 13:373,37336,460,05727,999,00002,113,536
6May 10, 2026 13:373,39037,494,46528,143,00002,113,536
7May 10, 2026 13:373,42435,918,84828,421,00002,113,536
8May 10, 2026 13:373,42536,512,58228,428,00002,113,536
9May 10, 2026 13:373,44738,280,13528,616,00002,113,536