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 25, 2026 16:59Victor MerckléVictor MerckléScore: 14,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 16:5914,976132,651,727123,283,0001,023,0002,117,632stderr
2Aug 25, 2026 16:5914,977132,713,841123,284,0001,028,0002,117,632stderr
3Aug 25, 2026 16:5914,979132,663,872123,296,0001,032,0002,117,632stderr
4Aug 25, 2026 16:5914,981132,698,067123,319,0001,025,0002,117,632stderr
5Aug 25, 2026 16:5914,983132,691,671123,327,0001,040,0002,117,632stderr
6Aug 25, 2026 16:5914,988132,753,826123,305,0001,096,0002,117,632stderr
7Aug 25, 2026 16:5914,990133,495,079123,311,0001,111,0002,117,632stderr
8Aug 25, 2026 16:5914,992132,792,886123,321,0001,115,0002,117,632stderr
9Aug 25, 2026 16:5915,024133,066,911123,575,0001,127,0002,117,632stderr