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 listJan 30, 2026 03:58Josu San MartinJosu San MartinScore: 6,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:585,93273,386,05247,226,0002,009,0002,367,488
2Jan 30, 2026 03:586,08072,203,24449,453,0001,009,0002,293,760
3Jan 30, 2026 03:586,09982,546,56550,619,00002,293,760
4Jan 30, 2026 03:586,12081,618,09848,807,0001,992,0002,281,472
5Jan 30, 2026 03:586,26678,300,36750,009,0002,000,0002,367,488
6Jan 30, 2026 03:588,494101,079,26769,495,0001,007,0002,359,296