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 22:04Daniel MastalerzDaniel MastalerzScore: 5,826Success
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 22:045,71872,028,53643,419,0004,039,0002,293,760
2Feb 19, 2026 22:045,75174,803,49544,747,0002,983,0002,306,048
3Feb 19, 2026 22:045,76876,363,82643,889,0003,989,0002,531,328
4Feb 19, 2026 22:045,82673,317,86645,332,0003,022,0002,322,432
5Feb 19, 2026 22:045,83473,457,62345,397,0003,026,0002,269,184
6Feb 19, 2026 22:045,84869,609,33246,519,0002,022,0002,322,432