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 15:46Josu San MartinJosu San MartinScore: 4,012Success
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 15:473,97040,656,75331,925,0001,028,0002,113,536
2May 10, 2026 15:473,97243,139,56331,963,0001,010,0002,113,536
3May 10, 2026 15:473,97940,176,13632,001,0001,027,0002,113,536
4May 10, 2026 15:473,99342,654,22632,096,0001,052,0002,113,536
5May 10, 2026 15:474,01242,874,60732,230,0001,073,0002,113,536
6May 10, 2026 15:474,01542,087,50532,273,0001,052,0002,113,536
7May 10, 2026 15:474,02442,754,48932,374,0001,033,0002,113,536
8May 10, 2026 15:474,03840,848,37432,414,0001,106,0002,113,536
9May 10, 2026 15:474,17049,159,83033,594,0001,023,0002,113,536