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 listMar 11, 2026 13:46Sergey SerebryakovSergey SerebryakovScore: 7,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 13:466,99079,742,36756,014,0002,000,0002,277,376
2Mar 11, 2026 13:467,04081,637,54857,428,0001,007,0002,445,312
3Mar 11, 2026 13:467,08584,253,51956,812,0001,993,0002,445,312
4Mar 11, 2026 13:467,47588,234,52560,038,0002,001,0002,441,216
5Mar 11, 2026 13:467,48488,283,54660,114,0002,003,0002,277,376
6Mar 11, 2026 13:467,48681,282,09860,129,0002,004,0002,277,376
7Mar 11, 2026 13:467,48986,494,61160,150,0002,005,0002,277,376
8Mar 11, 2026 13:467,49390,005,26360,188,0002,006,0002,277,376
9Mar 11, 2026 13:467,49785,924,77461,226,0001,003,0002,277,376
10Mar 11, 2026 13:467,50684,664,30061,296,0001,004,0002,277,376
11Mar 11, 2026 13:467,51285,080,47962,349,00002,445,312
12Mar 11, 2026 13:467,56788,616,49560,810,0001,993,0002,428,928