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 19:36Josu San MartinJosu San MartinScore: 4,839Success
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 19:364,82748,576,17139,029,0001,041,0002,113,536
2Aug 30, 2026 19:364,82748,626,23439,010,0001,059,0002,113,536
3Aug 30, 2026 19:364,82848,483,95039,046,0001,027,0002,113,536
4Aug 30, 2026 19:364,83448,591,33639,107,0001,021,0002,113,536
5Aug 30, 2026 19:364,83948,590,73139,114,0001,056,0002,113,536
6Aug 30, 2026 19:364,84248,615,55539,161,0001,035,0002,113,536
7Aug 30, 2026 19:364,84248,633,36739,164,0001,031,0002,113,536
8Aug 30, 2026 19:364,84548,764,85439,162,0001,055,0002,113,536
9Aug 30, 2026 19:364,84848,718,61339,131,0001,110,0002,113,536