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 listMay 10, 2026 05:18Josu San MartinJosu San MartinScore: 4,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:184,09649,870,85032,878,0001,122,0002,482,176
2May 10, 2026 05:184,10149,690,12832,908,0001,138,0002,473,984
3May 10, 2026 05:184,10150,007,06632,910,0001,131,0002,482,176
4May 10, 2026 05:184,10353,204,36932,930,0001,129,0002,490,368
5May 10, 2026 05:184,12248,003,36533,178,0001,039,0002,482,176
6May 10, 2026 05:184,12752,336,13633,138,0001,117,0002,482,176
7May 10, 2026 05:184,13148,869,71833,224,0001,065,0002,482,176
8May 10, 2026 05:184,14052,118,51833,212,0001,153,0002,478,080
9May 10, 2026 05:184,15851,586,36533,476,0001,039,0002,478,080