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 30, 2026 20:57Josu San MartinJosu San MartinScore: 4,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:004,37844,846,28135,299,0001,040,0002,113,536
2Aug 30, 2026 21:004,38244,870,17235,325,0001,048,0002,113,536
3Aug 30, 2026 21:004,38944,880,22135,387,0001,044,0002,113,536
4Aug 30, 2026 21:004,39444,947,47435,360,0001,114,0002,113,536
5Aug 30, 2026 21:004,39744,914,94935,457,0001,042,0002,113,536
6Aug 30, 2026 21:004,40344,971,64535,444,0001,103,0002,113,536
7Aug 30, 2026 21:004,41345,123,86135,509,0001,126,0002,113,536
8Aug 30, 2026 21:004,41345,168,40035,497,0001,138,0002,113,536
9Aug 30, 2026 21:004,46254,690,49836,023,0001,017,0002,113,536