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 15:07caandocaandoScore: 4,675Success
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 15:074,61864,993,80937,322,0001,008,0002,285,568
2Mar 11, 2026 15:074,62663,339,64035,363,0003,031,0002,285,568
3Mar 11, 2026 15:074,62764,227,98336,383,0002,021,0002,285,568
4Mar 11, 2026 15:074,63462,153,48236,442,0002,024,0002,486,272
5Mar 11, 2026 15:074,63762,000,35337,475,0001,012,0002,285,568
6Mar 11, 2026 15:074,64063,435,26438,512,00002,473,984
7Mar 11, 2026 15:074,67562,414,03935,820,0002,985,0002,482,176
8Mar 11, 2026 15:074,67665,233,52638,808,00002,490,368
9Mar 11, 2026 15:074,67863,552,49137,832,000995,0002,469,888
10Mar 11, 2026 15:074,68064,760,79637,850,000996,0002,486,272
11Mar 11, 2026 15:074,70866,421,66136,073,0003,006,0002,285,568
12Mar 11, 2026 15:074,75063,692,81036,393,0003,032,0002,285,568