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:37leoweleoweScore: 72,074Success
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:3772,007620,204,754538,695,00058,966,0002,281,472
2Apr 1, 2026 20:3772,017622,854,106535,767,00061,973,0002,359,296
3Apr 1, 2026 20:3772,038626,408,033530,926,00066,990,0002,269,184
4Apr 1, 2026 20:3772,053620,634,626536,039,00062,004,0002,293,760
5Apr 1, 2026 20:3772,074622,049,021536,193,00062,022,0002,289,664
6Apr 1, 2026 20:3772,116629,234,476536,610,00061,954,0002,269,184
7Apr 1, 2026 20:3772,125628,182,638536,676,00061,962,0002,265,088
8Apr 1, 2026 20:3772,131622,472,424533,720,00064,965,0002,289,664
9Apr 1, 2026 20:3772,351626,476,210538,566,00061,950,0002,273,280