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 listMar 8, 2026 15:47caandocaandoScore: 5,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 15:475,56972,466,69544,211,0002,009,0002,371,584
2Mar 8, 2026 15:475,57671,341,54644,265,0002,012,0002,514,944
3Mar 8, 2026 15:475,59070,191,62945,385,0001,008,0002,519,040
4Mar 8, 2026 15:475,59372,642,79845,409,0001,009,0002,285,568
5Mar 8, 2026 15:475,60072,752,04544,463,0002,021,0002,285,568
6Mar 8, 2026 15:475,61780,891,54445,606,0001,013,0002,527,232