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 08:28Josu San MartinJosu San MartinScore: 4,080Success
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 08:284,06446,526,01632,634,0001,099,0002,490,368
2May 10, 2026 08:284,07051,288,29832,638,0001,143,0002,482,176
3May 10, 2026 08:284,07649,793,86932,730,0001,101,0002,482,176
4May 10, 2026 08:284,07650,902,02232,709,0001,129,0002,478,080
5May 10, 2026 08:284,08050,781,76032,674,0001,191,0002,494,464
6May 10, 2026 08:284,08650,529,14032,878,0001,043,0002,482,176
7May 10, 2026 08:284,09152,702,77232,798,0001,160,0002,478,080
8May 10, 2026 08:284,09749,792,21432,863,0001,145,0002,482,176
9May 10, 2026 08:284,10551,651,05133,026,0001,049,0002,486,272