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 19, 2026 21:55Daniel MastalerzDaniel MastalerzScore: 5,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:555,75872,067,21045,758,0002,033,0002,371,584
2Feb 19, 2026 21:555,76671,340,26443,868,0003,988,0002,330,624
3Feb 19, 2026 21:555,76875,267,17644,880,0002,992,0002,527,232
4Feb 19, 2026 21:555,82769,683,06844,334,0004,030,0002,273,280
5Feb 19, 2026 21:555,84870,868,23445,506,0003,033,0002,322,432
6Feb 19, 2026 21:556,06969,804,08045,334,0005,037,0002,322,432