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 11, 2026 11:17RabenknechtRabenknechtScore: 65,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:1765,700555,317,673544,270,0001,040,0002,113,536
2Aug 11, 2026 11:1765,722555,456,513544,472,0001,025,0002,113,536
3Aug 11, 2026 11:1765,744555,678,211544,627,0001,051,0002,113,536
4Aug 11, 2026 11:1765,773556,077,199544,807,0001,116,0002,113,536
5Aug 11, 2026 11:1765,793556,400,335544,994,0001,088,0002,113,536
6Aug 11, 2026 11:1765,806556,241,132545,156,0001,042,0002,113,536
7Aug 11, 2026 11:1765,980557,784,959546,637,0001,002,0002,113,536
8Aug 11, 2026 11:1766,062558,980,350547,223,0001,093,0002,113,536
9Aug 11, 2026 11:1766,065558,517,604547,330,0001,010,0002,113,536