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 listOct 25, 2026 11:34timothygktimothygkScore: 8,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 11:428,77985,217,82662,880,0009,988,0002,117,632stderr
2Oct 25, 2026 11:428,86584,589,98363,145,00010,438,0002,117,632stderr
3Oct 25, 2026 11:428,88684,830,82263,354,00010,403,0002,117,632stderr
4Oct 25, 2026 11:428,88985,255,83362,768,00011,017,0002,117,632stderr
5Oct 25, 2026 11:428,91386,489,16763,550,00010,428,0002,117,632stderr
6Oct 25, 2026 11:428,91685,022,68363,552,00010,457,0002,117,632stderr
7Oct 25, 2026 11:428,93985,681,00863,168,00011,031,0002,117,632stderr
8Oct 25, 2026 11:428,95885,362,65063,598,00010,756,0002,117,632stderr
9Oct 25, 2026 11:428,97985,576,17963,437,00011,092,0002,117,632stderr