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 listApr 26, 2026 13:30wnwnScore: 3,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:303,40440,475,35227,248,0001,009,0002,547,712
2Apr 26, 2026 13:303,42251,207,65727,390,0001,014,0002,482,176
3Apr 26, 2026 13:303,43145,315,76627,466,0001,017,0002,473,984
4Apr 26, 2026 13:303,43342,442,04327,485,0001,017,0002,473,984
5Apr 26, 2026 13:303,44444,364,59127,566,0001,020,0002,486,272
6Apr 26, 2026 13:303,50748,443,51127,106,0002,007,0002,490,368
7Apr 26, 2026 13:303,57247,087,70828,629,0001,022,0002,486,272
8Apr 26, 2026 13:303,60746,527,92127,950,0001,996,0002,486,272
9Apr 26, 2026 13:303,66243,181,85228,437,0001,961,0002,478,080