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 listJul 18, 2026 12:38Kevin HeaveyKevin HeaveyScore: 3,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:063,60739,625,05028,736,0001,206,0002,117,632
2Jul 18, 2026 13:063,61639,739,05428,978,0001,042,0002,117,632
3Jul 18, 2026 13:063,62939,913,78529,085,0001,042,0002,117,632
4Jul 18, 2026 13:063,78741,212,58930,203,0001,231,0002,117,632
5Jul 18, 2026 13:063,80841,300,93130,570,0001,040,0002,117,632
6Jul 18, 2026 13:063,90142,110,44531,151,0001,230,0002,117,632
7Jul 18, 2026 13:063,90342,146,28831,322,0001,073,0002,117,632
8Jul 18, 2026 13:063,97942,762,75331,787,0001,241,0002,117,632
9Jul 18, 2026 13:064,10655,496,18433,040,0001,041,0002,117,632