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 21, 2026 10:04Victor MerckléVictor MerckléScore: 4,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:054,91349,805,18539,693,0001,085,0002,113,536
2May 21, 2026 10:054,92348,961,09739,837,0001,026,0002,113,536
3May 21, 2026 10:054,93250,706,23839,915,0001,025,0002,113,536
4May 21, 2026 10:054,93849,075,58439,946,0001,041,0002,113,536
5May 21, 2026 10:054,93950,101,42939,965,0001,035,0002,113,536
6May 21, 2026 10:054,94049,142,00139,989,0001,015,0002,113,536
7May 21, 2026 10:054,94050,667,83639,953,0001,056,0002,113,536
8May 21, 2026 10:054,94649,461,77540,053,0001,002,0002,113,536
9May 21, 2026 10:055,00650,528,28240,530,0001,025,0002,113,536