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 20, 2026 16:20Daniel MastalerzDaniel MastalerzScore: 6,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:206,52082,923,26650,105,0004,008,0002,310,144
2Feb 20, 2026 16:206,54279,826,17750,276,0004,022,0002,273,280
3Feb 20, 2026 16:206,65577,243,35652,222,0003,012,0002,306,048
4Feb 20, 2026 16:206,66281,934,63251,276,0004,021,0002,322,432
5Feb 20, 2026 16:206,66678,790,85352,311,0003,017,0002,322,432
6Feb 20, 2026 16:206,76682,182,24453,152,0003,008,0002,527,232