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 listAug 30, 2026 18:53Josu San MartinJosu San MartinScore: 4,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:544,58646,566,19637,040,0001,030,0002,113,536
2Aug 30, 2026 18:544,59646,593,16237,099,0001,049,0002,113,536
3Aug 30, 2026 18:544,60546,715,73237,105,0001,123,0002,113,536
4Aug 30, 2026 18:544,61346,745,29437,190,0001,104,0002,113,536
5Aug 30, 2026 18:544,61646,741,03037,206,0001,110,0002,113,536
6Aug 30, 2026 18:544,62946,890,55737,324,0001,103,0002,113,536
7Aug 30, 2026 18:544,64647,043,98537,445,0001,123,0002,113,536
8Aug 30, 2026 18:544,76849,163,70138,556,0001,025,0002,113,536
9Aug 30, 2026 18:544,76948,136,05938,548,0001,040,0002,113,536