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 listAug 17, 2026 22:20Josu San MartinJosu San MartinScore: 5,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 22:335,09552,035,70141,068,0001,227,0002,174,976
2Aug 17, 2026 22:335,09752,055,77241,072,0001,238,0002,134,016
3Aug 17, 2026 22:335,10652,503,34141,180,0001,205,0002,174,976
4Aug 17, 2026 22:335,10652,189,22641,170,0001,214,0002,134,016
5Aug 17, 2026 22:335,11052,196,58841,188,0001,230,0002,129,920
6Aug 17, 2026 22:335,11552,571,42041,244,0001,218,0002,174,976
7Aug 17, 2026 22:335,11852,204,71541,263,0001,220,0002,129,920
8Aug 17, 2026 22:335,12152,276,16941,284,0001,221,0002,129,920
9Aug 17, 2026 22:335,49955,452,05744,433,0001,214,0002,134,016