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:08caandocaandoScore: 4,681Success
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:084,64263,606,03637,515,0001,013,0002,490,368
2Mar 11, 2026 15:084,65468,307,02837,612,0001,016,0002,482,176
3Mar 11, 2026 15:084,67767,598,87237,828,000995,0002,490,368
4Mar 11, 2026 15:084,68163,585,73935,867,0002,988,0002,285,568
5Mar 11, 2026 15:084,77163,145,73238,583,0001,015,0002,486,272
6Mar 11, 2026 15:084,81267,939,51537,945,0001,997,0002,490,368