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 10, 2026 19:34Mikołaj UzarskiMikołaj UzarskiScore: 7,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:347,04481,026,52152,416,0006,048,0002,408,448
2Feb 10, 2026 19:347,08087,244,30551,795,0006,972,0002,510,848
3Feb 10, 2026 19:347,08286,707,79851,804,0006,973,0002,412,544
4Feb 10, 2026 19:347,08782,016,84551,721,0007,099,0002,412,544
5Feb 10, 2026 19:347,09685,004,75052,908,0005,989,0002,318,336
6Feb 10, 2026 19:347,10182,369,35750,946,0007,991,0002,445,312
7Feb 10, 2026 19:347,11888,800,77752,067,0007,009,0002,461,696
8Feb 10, 2026 19:347,16487,706,82052,404,0007,054,0002,453,504
9Feb 10, 2026 19:347,18687,546,45452,569,0007,076,0002,490,368