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 7, 2026 19:35Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:35039,190,32128,377,0001,170,0002,117,632expected "53690436117331332 ", got "171763583450776933"
2Jul 7, 2026 19:35038,776,87028,142,0001,147,0002,117,632expected "53679104139635871 ", got "171634383582502458"
3Jul 7, 2026 19:35038,706,17328,110,0001,123,0002,117,632expected "53680492112550949 ", got "171706329854426845"