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 19, 2026 12:44Victor MerckléVictor MerckléScore: 6,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 12:466,10360,073,47649,637,0001,021,0002,113,536
2May 19, 2026 12:466,10459,288,30349,642,0001,022,0002,113,536
3May 19, 2026 12:466,19359,886,69950,386,0001,023,0002,113,536
4May 19, 2026 12:466,26159,761,30850,949,0001,022,0002,113,536
5May 19, 2026 12:466,26359,880,43250,953,0001,032,0002,113,536
6May 19, 2026 12:466,26559,810,78950,988,0001,015,0002,113,536
7May 19, 2026 12:466,27659,887,74751,075,0001,018,0002,113,536
8May 19, 2026 12:466,29164,979,48751,187,0001,032,0002,113,536
9May 19, 2026 12:466,32560,324,71051,473,0001,026,0002,113,536