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 listSep 6, 2026 03:50CheckHarryCheckHarryScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:513,86641,898,36231,065,0001,027,0002,113,536
2Sep 6, 2026 03:513,86942,077,42831,100,0001,016,0002,113,536
3Sep 6, 2026 03:513,86941,964,60531,095,0001,018,0002,113,536
4Sep 6, 2026 03:513,87642,089,92931,160,0001,013,0002,113,536
5Sep 6, 2026 03:513,88242,086,39331,212,0001,013,0002,113,536
6Sep 6, 2026 03:513,88442,143,03731,225,0001,013,0002,113,536
7Sep 6, 2026 03:513,96142,780,38831,867,0001,010,0002,113,536
8Sep 6, 2026 03:514,01043,170,33232,262,0001,028,0002,113,536
9Sep 6, 2026 03:514,01244,342,97832,291,0001,015,0002,113,536