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 listAug 4, 2026 05:54Teow Hua JunTeow Hua JunScore: 6,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 05:546,87066,985,37055,931,0001,096,0002,113,536
2Aug 4, 2026 05:546,88167,206,37856,016,0001,104,0002,113,536
3Aug 4, 2026 05:546,88367,092,97756,015,0001,120,0002,113,536
4Aug 4, 2026 05:546,89467,220,81856,126,0001,096,0002,113,536
5Aug 4, 2026 05:546,89567,944,28456,093,0001,140,0002,113,536
6Aug 4, 2026 05:546,89567,959,67056,102,0001,132,0002,113,536
7Aug 4, 2026 05:546,90368,779,03256,189,0001,109,0002,113,536
8Aug 4, 2026 05:546,90967,438,15156,213,0001,135,0002,113,536
9Aug 4, 2026 05:546,91267,553,78256,217,0001,159,0002,113,536