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:15Josu San MartinJosu San MartinScore: 6,226Success
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:155,86478,119,50848,671,00002,416,640
2Feb 19, 2026 01:155,87878,900,46246,793,0001,991,0002,293,760
3Feb 19, 2026 01:155,95973,966,11847,445,0002,018,0002,473,984
4Feb 19, 2026 01:156,22674,160,13850,666,0001,013,0002,478,080
5Feb 19, 2026 01:156,60483,814,17653,814,000996,0002,285,568
6Feb 19, 2026 01:156,60681,890,25252,837,0001,993,0002,260,992