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:46Josu San MartinJosu San MartinScore: 4,107Success
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:474,05451,379,02132,537,0001,119,0002,490,368
2May 10, 2026 08:474,05949,287,43732,572,0001,121,0002,490,368
3May 10, 2026 08:474,09949,288,35432,986,0001,036,0002,486,272
4May 10, 2026 08:474,10048,877,99732,946,0001,085,0002,486,272
5May 10, 2026 08:474,10749,292,64833,002,0001,094,0002,490,368
6May 10, 2026 08:474,10849,547,92432,937,0001,165,0002,482,176
7May 10, 2026 08:474,11450,507,73032,976,0001,173,0002,482,176
8May 10, 2026 08:474,11551,465,46033,123,0001,032,0002,486,272
9May 10, 2026 08:474,12350,479,45333,188,0001,040,0002,486,272