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 20, 2026 12:24Dominique GarmierDominique GarmierScore: 7,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:247,76485,245,47663,432,0001,006,0002,465,792
2Mar 20, 2026 12:247,76486,901,42263,437,0001,006,0002,490,368
3Mar 20, 2026 12:247,78592,281,65663,608,0001,009,0002,478,080
4Mar 20, 2026 12:247,80990,391,52162,817,0001,994,0002,289,664
5Mar 20, 2026 12:247,82788,254,03662,966,0001,998,0002,461,696
6Mar 20, 2026 12:247,85199,524,09563,162,0002,005,0002,289,664
7Mar 20, 2026 12:247,87496,727,32963,347,0002,011,0002,326,528
8Mar 20, 2026 12:247,89190,896,77063,484,0002,015,0002,465,792
9Mar 20, 2026 12:247,92997,995,63463,815,0001,994,0002,482,176