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 2, 2026 15:18caandocaandoScore: 5,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:185,56269,547,01844,158,0002,007,0002,285,568
2Mar 2, 2026 15:185,56370,003,65545,168,0001,003,0002,285,568
3Mar 2, 2026 15:185,57368,908,15244,248,0002,011,0002,285,568
4Mar 2, 2026 15:185,66671,689,30446,025,0001,000,0002,265,088
5Mar 2, 2026 15:185,67467,826,53645,093,0002,004,0002,285,568
6Mar 2, 2026 15:185,70768,616,40745,356,0002,015,0002,519,040