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 listApr 10, 2026 19:54Danylo MocherniukDanylo MocherniukScore: 4,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 19:534,46864,165,64035,080,0002,004,0002,392,064
2Apr 10, 2026 19:534,47257,521,93635,113,0002,006,0002,297,856
3Apr 10, 2026 19:534,49361,393,11834,269,0003,023,0002,387,968
4Apr 10, 2026 19:544,49965,438,92636,331,0001,009,0002,392,064
5Apr 10, 2026 19:534,62166,024,15435,328,0003,028,0002,383,872
6Apr 10, 2026 19:534,63663,400,69235,440,0003,037,0002,297,856
7Apr 10, 2026 19:544,65570,993,18337,620,0001,016,0002,383,872
8Apr 10, 2026 19:534,68366,956,96136,879,0001,993,0002,297,856
9Apr 10, 2026 19:534,70760,973,18336,062,0003,005,0002,297,856
10Apr 10, 2026 19:534,72164,949,01536,171,0003,014,0002,387,968
11Apr 10, 2026 19:544,72667,428,18937,212,0002,011,0002,387,968
12Apr 10, 2026 19:534,75666,937,99836,440,0003,036,0002,297,856