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 listFeb 8, 2026 20:29Daniel MastalerzDaniel MastalerzScore: 11,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 20:2911,677125,546,41292,922,0003,996,0002,400,256
2Feb 8, 2026 20:2911,686122,025,99392,997,0003,999,0002,338,816
3Feb 8, 2026 20:2911,786119,739,34195,825,0001,996,0002,334,720
4Feb 8, 2026 20:2911,862125,170,08594,437,0004,018,0002,404,352
5Feb 8, 2026 20:2911,877124,689,55996,565,0002,011,0002,408,448
6Feb 8, 2026 20:2912,079123,708,09995,242,0005,012,0002,293,760