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 24, 2026 17:15Daniel MastalerzDaniel MastalerzScore: 5,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 17:155,62076,936,27943,602,0003,042,0002,330,624
2Feb 24, 2026 17:155,70470,592,03244,324,0003,022,0002,322,432
3Feb 24, 2026 17:155,76470,240,59344,850,0002,990,0002,514,944