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 20, 2026 06:34M-RochatM-RochatScore: 12,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:3612,270112,186,25499,835,0002,011,0002,113,536
2May 20, 2026 06:3612,278114,439,87399,902,0002,012,0002,113,536
3May 20, 2026 06:3612,279111,597,58699,915,0002,007,0002,113,536
4May 20, 2026 06:3612,281111,997,54699,930,0002,007,0002,113,536
5May 20, 2026 06:3612,291111,438,48199,865,0002,155,0002,113,536
6May 20, 2026 06:3612,296111,752,072100,048,0002,014,0002,113,536
7May 20, 2026 06:3612,297111,589,348100,056,0002,012,0002,113,536
8May 20, 2026 06:3612,302112,008,486101,098,0001,010,0002,113,536
9May 20, 2026 06:3612,340114,311,721100,408,0002,022,0002,113,536