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 03:20Josu San MartinJosu San MartinScore: 4,624Success
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 03:214,59456,377,05637,006,0001,126,0002,494,464
2May 10, 2026 03:214,60656,074,27037,081,0001,157,0002,490,368
3May 10, 2026 03:214,61456,127,34937,248,0001,050,0002,494,464
4May 10, 2026 03:214,61756,063,77737,279,0001,046,0002,482,176
5May 10, 2026 03:214,62454,326,19337,325,0001,061,0002,486,272
6May 10, 2026 03:214,62652,472,29137,309,0001,089,0002,482,176
7May 10, 2026 03:214,62655,980,76637,357,0001,045,0002,490,368
8May 10, 2026 03:214,63252,582,37537,429,0001,023,0002,482,176
9May 10, 2026 03:214,73154,917,14338,222,0001,049,0002,482,176