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 24, 2026 19:31Kevin HeaveyKevin HeaveyScore: 3,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 19:323,49037,214,63127,776,0001,194,0002,113,536
2Jul 24, 2026 19:323,51237,397,66727,930,0001,222,0002,113,536
3Jul 24, 2026 19:323,54237,766,32128,354,0001,047,0002,113,536
4Jul 24, 2026 19:323,55237,641,82328,401,0001,085,0002,113,536
5Jul 24, 2026 19:323,62538,332,66029,025,0001,068,0002,113,536
6Jul 24, 2026 19:323,74840,066,38629,880,0001,236,0002,113,536
7Jul 24, 2026 19:323,78439,680,09330,219,0001,190,0002,113,536
8Jul 24, 2026 19:323,80539,830,81330,533,0001,050,0002,113,536
9Jul 24, 2026 19:323,80639,753,70830,377,0001,215,0002,113,536