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 listJun 30, 2026 10:10Victor MerckléVictor MerckléScore: 4,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:124,19042,680,87933,666,0001,119,0002,117,632stderr
2Jun 30, 2026 10:124,19142,696,65933,668,0001,118,0002,117,632stderr
3Jun 30, 2026 10:124,20642,823,20833,879,0001,032,0002,117,632stderr
4Jun 30, 2026 10:124,20842,624,62833,909,0001,021,0002,117,632stderr
5Jun 30, 2026 10:124,20842,793,50333,890,0001,042,0002,117,632stderr
6Jun 30, 2026 10:124,20943,927,87733,829,0001,110,0002,117,632stderr
7Jun 30, 2026 10:124,20942,932,81633,832,0001,109,0002,117,632stderr
8Jun 30, 2026 10:124,36344,019,88735,204,0001,009,0002,117,632stderr
9Jun 30, 2026 10:124,38144,177,10835,297,0001,066,0002,117,632stderr