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 11, 2026 20:00Daniel MastalerzDaniel MastalerzScore: 5,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 20:005,38368,932,57142,650,0002,030,0002,420,736
2Mar 11, 2026 20:005,40171,468,41442,834,0001,992,0002,285,568
3Mar 11, 2026 20:005,46070,274,86042,299,0003,021,0002,277,376
4Mar 11, 2026 20:005,56467,481,85144,171,0002,007,0002,285,568
5Mar 11, 2026 20:005,56569,892,91343,174,0003,012,0002,416,640
6Mar 11, 2026 20:005,57472,610,30343,251,0003,017,0002,412,544