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 19, 2026 04:43Joel ChongJoel ChongScore: 48,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 04:4348,497431,628,015400,530,0001,997,0002,285,568
2Mar 19, 2026 04:4348,516427,567,827401,681,000999,0002,260,992
3Mar 19, 2026 04:4348,553424,777,904401,990,000999,0002,281,472
4Mar 19, 2026 04:4348,553427,840,334400,987,0001,999,0002,519,040
5Mar 19, 2026 04:4348,574425,515,210402,167,0001,000,0002,265,088
6Mar 19, 2026 04:4348,596431,474,478402,345,0001,000,0002,285,568
7Mar 19, 2026 04:4348,649427,603,765401,791,0001,998,0002,285,568
8Mar 19, 2026 04:4348,651426,154,416402,808,000999,0002,396,160
9Mar 19, 2026 04:4348,691425,059,151402,132,0002,000,0002,375,680