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 15, 2026 19:30Mikołaj UzarskiMikołaj UzarskiScore: 6,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 19:326,01575,626,50643,937,0005,991,0002,392,064
2Feb 15, 2026 19:406,09575,660,80545,527,0005,058,0002,408,448
3Feb 15, 2026 19:306,12975,352,75943,888,0006,982,0002,400,256
4Feb 15, 2026 19:326,13176,589,62445,898,0004,988,0002,383,872
5Feb 15, 2026 19:306,13774,662,62244,947,0005,993,0002,400,256
6Feb 15, 2026 19:406,15674,733,47345,082,0006,010,0002,351,104
7Feb 15, 2026 19:326,16575,469,43046,150,0005,016,0002,400,256
8Feb 15, 2026 19:406,18371,572,11845,281,0006,037,0002,449,408
9Feb 15, 2026 19:306,39673,972,56945,076,0008,013,0002,293,760