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 19, 2026 01:36Josu San MartinJosu San MartinScore: 6,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 01:366,15180,233,98648,048,0003,003,0002,392,064
2Feb 19, 2026 01:366,24077,894,39050,800,000996,0002,281,472
3Feb 19, 2026 01:366,24278,042,28548,818,0002,988,0002,396,160
4Feb 19, 2026 01:366,24379,652,80449,822,0001,992,0002,277,376
5Feb 19, 2026 01:366,24476,953,19448,833,0002,989,0002,506,752
6Feb 19, 2026 01:366,36278,909,01351,810,000996,0002,400,256