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 13:13CheckHarryCheckHarryScore: 23,009Success
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 13:1322,261211,662,362182,773,0001,997,0002,281,472
2Feb 20, 2026 13:1322,770212,647,664184,994,0003,999,0002,510,848
3Feb 20, 2026 13:1323,006215,583,440188,951,0001,999,0002,281,472
4Feb 20, 2026 13:1323,009211,382,887187,972,0002,999,0002,355,200
5Feb 20, 2026 13:1323,009217,226,188189,978,000999,0002,510,848
6Feb 20, 2026 13:1323,013216,151,924188,004,0003,000,0002,502,656
7Feb 20, 2026 13:1323,029213,037,177189,142,0002,001,0002,342,912
8Feb 20, 2026 13:1323,030214,908,899189,151,0002,001,0002,289,664
9Feb 20, 2026 13:1323,034219,948,300190,186,0001,000,0002,281,472