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 10, 2026 15:42caandocaandoScore: 5,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 15:425,10268,468,60240,332,0002,016,0002,285,568
2Mar 10, 2026 15:425,10367,890,02940,336,0002,016,0002,506,752
3Mar 10, 2026 15:425,10763,549,20639,357,0003,027,0002,506,752
4Mar 10, 2026 15:425,12763,307,05041,541,0001,013,0002,523,136
5Mar 10, 2026 15:425,13268,620,42741,585,0001,014,0002,506,752
6Mar 10, 2026 15:425,15970,476,14040,830,0001,991,0002,285,568