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 listMay 10, 2026 10:50Josu San MartinJosu San MartinScore: 4,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:514,05948,838,08632,593,0001,097,0002,482,176
2May 10, 2026 10:514,06247,809,36532,608,0001,111,0002,494,464
3May 10, 2026 10:514,06650,503,51632,645,0001,103,0002,486,272
4May 10, 2026 10:514,07548,705,10132,727,0001,100,0002,478,080
5May 10, 2026 10:514,07549,364,30432,694,0001,131,0002,482,176
6May 10, 2026 10:514,07748,791,74832,748,0001,097,0002,486,272
7May 10, 2026 10:514,08052,657,86132,822,0001,044,0002,486,272
8May 10, 2026 10:514,11349,025,53833,025,0001,116,0002,469,888
9May 10, 2026 10:514,11454,958,84433,098,0001,049,0002,490,368