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 24, 2026 16:48Victor MerckléVictor MerckléScore: 4,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 16:494,57147,534,99136,865,0001,075,0002,113,536
2May 24, 2026 16:494,57546,045,08236,917,0001,058,0002,113,536
3May 24, 2026 16:494,58345,871,55336,970,0001,077,0002,113,536
4May 24, 2026 16:494,58845,871,11737,071,0001,013,0002,113,536
5May 24, 2026 16:494,59148,767,52637,033,0001,078,0002,113,536
6May 24, 2026 16:494,59247,748,89137,090,0001,028,0002,113,536
7May 24, 2026 16:494,59747,538,95837,151,0001,006,0002,113,536
8May 24, 2026 16:494,60046,427,11037,075,0001,106,0002,113,536
9May 24, 2026 16:494,65351,028,43337,589,0001,031,0002,113,536