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 24, 2026 21:12Mikołaj UzarskiMikołaj UzarskiScore: 5,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:125,39772,455,36342,807,0001,991,0002,285,568
2Feb 24, 2026 21:125,40265,666,62342,844,0001,992,0002,510,848
3Feb 24, 2026 21:125,40373,330,37942,855,0001,993,0002,285,568
4Feb 24, 2026 21:125,41379,633,71144,928,00002,281,472
5Feb 24, 2026 21:125,42068,451,80242,989,0001,999,0002,506,752
6Feb 24, 2026 21:125,44569,593,49142,183,0003,013,0002,326,528
7Feb 24, 2026 21:125,44867,696,77543,207,0002,009,0002,510,848
8Feb 24, 2026 21:125,45867,644,52043,291,0002,013,0002,281,472
9Feb 24, 2026 21:125,55468,652,45144,092,0002,004,0002,281,472