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 9, 2026 19:35Josu San MartinJosu San MartinScore: 5,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 19:365,03056,820,27240,638,0001,119,0002,551,808
2May 9, 2026 19:365,03659,109,12540,743,0001,061,0002,551,808
3May 9, 2026 19:365,05157,100,81240,890,0001,041,0002,547,712
4May 9, 2026 19:365,06258,256,73940,864,0001,153,0002,547,712
5May 9, 2026 19:365,07458,175,41641,036,0001,081,0002,547,712
6May 9, 2026 19:365,07757,874,20741,082,0001,064,0002,551,808
7May 9, 2026 19:365,11059,972,84841,253,0001,160,0002,555,904
8May 9, 2026 19:365,13659,551,02441,488,0001,146,0002,539,520
9May 9, 2026 19:365,30160,109,73542,844,0001,159,0002,543,616