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 14, 2026 02:27Victor MerckléVictor MerckléScore: 7,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:277,28469,104,09260,459,00002,113,536
2May 14, 2026 02:277,28467,991,94860,464,00002,113,536
3May 14, 2026 02:277,28568,386,05160,473,00002,113,536
4May 14, 2026 02:277,28967,786,99459,452,0001,047,0002,113,536
5May 14, 2026 02:277,29067,864,76559,496,0001,012,0002,113,536
6May 14, 2026 02:277,29570,359,93059,552,0001,004,0002,113,536
7May 14, 2026 02:277,35470,586,26360,020,0001,019,0002,113,536
8May 14, 2026 02:277,46370,070,92460,948,0001,001,0002,113,536
9May 14, 2026 02:277,50770,131,79362,316,00002,113,536