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 15, 2026 15:09timothygktimothygkScore: 46,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:0945,992392,821,206380,628,0001,110,0002,117,632stderr
2Oct 15, 2026 15:0945,997392,978,656380,674,0001,102,0002,117,632stderr
3Oct 15, 2026 15:0946,000393,040,938380,806,0001,002,0002,117,632stderr
4Oct 15, 2026 15:0946,138393,519,800381,849,0001,102,0002,117,632stderr
5Oct 15, 2026 15:0946,196394,020,385382,430,0001,002,0002,117,632stderr
6Oct 15, 2026 15:0946,663398,591,094386,308,0001,002,0002,117,632stderr
7Oct 15, 2026 15:0947,195402,176,449390,646,0001,077,0002,117,632stderr
8Oct 15, 2026 15:0947,209402,342,664390,745,0001,096,0002,117,632stderr
9Oct 15, 2026 15:0947,214403,314,253390,776,0001,103,0002,117,632stderr