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 listJul 19, 2026 11:39Ondřej PolaneckýOndřej PolaneckýScore: 174,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 11:40174,0081,454,012,6171,443,273,0001,000,0002,117,632stderr
2Jul 19, 2026 11:40174,2101,455,637,4811,444,943,0001,004,0002,117,632stderr
3Jul 19, 2026 11:40174,4101,457,477,9821,446,599,0001,005,0002,117,632stderr
4Jul 19, 2026 11:40174,4291,458,138,2951,446,768,0001,000,0002,117,632stderr
5Jul 19, 2026 11:40174,5641,459,963,8261,447,885,0001,001,0002,117,632stderr
6Jul 19, 2026 11:40174,5881,458,802,1221,448,077,0001,004,0002,117,632stderr
7Jul 19, 2026 11:40174,6061,458,931,0591,448,072,0001,161,0002,117,632stderr
8Jul 19, 2026 11:40176,1061,471,332,0591,460,673,0001,007,0002,117,632stderr
9Jul 19, 2026 11:40176,4241,474,151,8261,463,120,0001,201,0002,117,632stderr