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 17, 2026 22:29lipapipalipapipaScore: 6,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:296,57781,129,88554,591,00002,514,944
2Feb 17, 2026 22:296,70282,947,22353,604,0002,022,0002,494,464
3Feb 17, 2026 22:296,75777,979,32154,079,0002,002,0002,289,664
4Feb 17, 2026 22:296,81588,364,91454,546,0002,020,0002,351,104
5Feb 17, 2026 22:296,87282,430,05556,039,0001,000,0002,310,144
6Feb 17, 2026 22:296,96984,761,15055,845,0001,994,0002,502,656