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 6, 2026 13:33Danylo MocherniukDanylo MocherniukScore: 7,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 13:337,10380,955,36753,962,0004,996,0002,400,256
2Apr 6, 2026 13:337,10985,637,34155,007,0004,000,0002,359,296
3Apr 6, 2026 13:317,12782,188,45353,137,0006,015,0002,400,256
4Apr 6, 2026 13:337,15682,866,74155,371,0004,027,0002,412,544
5Apr 6, 2026 13:317,18886,033,08454,606,0005,056,0002,428,928
6Apr 6, 2026 13:337,20888,759,91453,847,0005,983,0002,392,064
7Apr 6, 2026 13:317,21083,996,83454,853,0004,986,0002,453,504
8Apr 6, 2026 13:337,26684,430,65056,289,0004,020,0002,400,256
9Apr 6, 2026 13:337,35288,288,38657,017,0004,001,0002,326,528