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 14:31Victor MerckléVictor MerckléScore: 4,666Success
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 14:324,64948,264,72337,539,0001,052,0002,113,536
2May 21, 2026 14:324,65348,174,78437,589,0001,038,0002,113,536
3May 21, 2026 14:324,65746,559,54437,584,0001,077,0002,113,536
4May 21, 2026 14:324,65846,498,78037,607,0001,058,0002,113,536
5May 21, 2026 14:324,66647,861,50737,727,0001,006,0002,113,536
6May 21, 2026 14:324,67646,636,18137,799,0001,017,0002,113,536
7May 21, 2026 14:324,68148,404,58637,800,0001,057,0002,113,536
8May 21, 2026 14:324,69346,844,80737,885,0001,072,0002,113,536
9May 21, 2026 14:324,73447,331,52638,275,0001,021,0002,113,536