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 listJan 4, 2026 05:45Josu San MartinJosu San MartinScore: 9,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 05:459,30798,419,23976,245,0001,003,0002,404,352
2Jan 4, 2026 05:459,348107,091,07976,582,0001,007,0002,412,544
3Jan 4, 2026 05:459,349102,708,06276,590,0001,007,0002,281,472
4Jan 4, 2026 05:459,536102,210,63177,142,0002,003,0002,277,376
5Jan 4, 2026 05:459,56598,261,72178,382,0001,004,0002,412,544
6Jan 4, 2026 05:459,571109,493,01076,424,0003,016,0002,277,376