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 12, 2026 02:27Victor MerckléVictor MerckléScore: 3,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 02:283,81040,031,11430,432,0001,193,0002,117,632stderr
2Aug 12, 2026 02:283,81340,051,51930,512,0001,143,0002,117,632stderr
3Aug 12, 2026 02:283,82440,256,54330,558,0001,188,0002,117,632stderr
4Aug 12, 2026 02:283,86240,374,92730,954,0001,106,0002,117,632stderr
5Aug 12, 2026 02:283,86340,498,66430,961,0001,105,0002,117,632stderr
6Aug 12, 2026 02:283,86440,470,96430,979,0001,093,0002,117,632stderr
7Aug 12, 2026 02:283,87140,521,01131,055,0001,081,0002,117,632stderr
8Aug 12, 2026 02:283,93941,159,23731,577,0001,123,0002,117,632stderr
9Aug 12, 2026 02:283,97041,408,84031,833,0001,123,0002,117,632stderr