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 11, 2026 07:16wnwnScore: 3,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:173,31336,710,97827,503,00002,113,536
2May 11, 2026 07:173,33434,927,92727,679,00002,113,536
3May 11, 2026 07:173,46737,597,71928,780,00002,113,536
4May 11, 2026 07:173,47538,532,48228,850,00002,113,536
5May 11, 2026 07:173,47836,447,72828,869,00002,113,536
6May 11, 2026 07:173,48137,385,80028,895,00002,113,536
7May 11, 2026 07:173,49237,052,59927,988,0001,002,0002,113,536
8May 11, 2026 07:173,50136,603,04329,065,00002,113,536
9May 11, 2026 07:173,50439,671,18429,086,00002,113,536