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 11, 2026 20:54Victor MerckléVictor MerckléScore: 11,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 20:5510,89798,864,86785,128,0005,322,0002,117,632stderr
2Aug 11, 2026 20:5510,90498,861,20185,145,0005,366,0002,117,632stderr
3Aug 11, 2026 20:5510,92199,009,39985,404,0005,243,0002,117,632stderr
4Aug 11, 2026 20:5510,92999,091,32585,496,0005,216,0002,117,632stderr
5Aug 11, 2026 20:5511,00099,776,22685,944,0005,358,0002,117,632stderr
6Aug 11, 2026 20:5511,00799,700,98085,798,0005,563,0002,117,632stderr
7Aug 11, 2026 20:5511,00999,786,66985,774,0005,606,0002,117,632stderr
8Aug 11, 2026 20:5511,01299,795,17386,116,0005,284,0002,117,632stderr
9Aug 11, 2026 20:5511,01399,831,61786,013,0005,399,0002,117,632stderr