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 14, 2026 18:07marko1597marko1597Score: 115,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:08114,570961,733,517949,790,0001,147,0002,117,632stderr
2Aug 14, 2026 18:08114,786963,511,472951,483,0001,247,0002,117,632stderr
3Aug 14, 2026 18:08115,094965,723,603954,282,0001,001,0002,117,632stderr
4Aug 14, 2026 18:08115,160976,054,113954,831,0001,001,0002,117,632stderr
5Aug 14, 2026 18:08115,655970,182,510958,937,0001,001,0002,117,632stderr
6Aug 14, 2026 18:08115,804971,992,115960,178,0001,001,0002,117,632stderr
7Aug 14, 2026 18:08115,850971,684,067960,398,0001,163,0002,117,632stderr
8Aug 14, 2026 18:08115,889972,717,664959,840,0002,040,0002,117,632stderr
9Aug 14, 2026 18:08116,517977,433,353966,092,0001,003,0002,117,632stderr