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 13:19Victor MerckléVictor MerckléScore: 4,687Success
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 13:204,64449,399,27237,486,0001,064,0002,113,536
2May 21, 2026 13:204,68147,118,48037,819,0001,037,0002,113,536
3May 21, 2026 13:204,68547,313,66437,849,0001,038,0002,113,536
4May 21, 2026 13:204,68749,147,20237,860,0001,045,0002,113,536
5May 21, 2026 13:204,68747,625,79937,845,0001,062,0002,113,536
6May 21, 2026 13:204,68947,139,49037,888,0001,032,0002,113,536
7May 21, 2026 13:204,69147,613,32837,883,0001,057,0002,113,536
8May 21, 2026 13:204,79048,549,83538,734,0001,030,0002,113,536
9May 21, 2026 13:204,86950,292,45739,414,0001,005,0002,113,536