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 18, 2026 00:23olliecrowolliecrowScore: 8,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:237,95294,024,23562,002,0004,000,0002,506,752
2Feb 18, 2026 00:237,95793,145,15264,039,0002,001,0002,441,216
3Feb 18, 2026 00:238,10991,007,85162,281,0005,022,0002,478,080
4Feb 18, 2026 00:238,15195,274,08062,680,0004,974,0002,330,624
5Feb 18, 2026 00:238,17296,689,91164,835,0002,992,0002,387,968
6Feb 18, 2026 00:238,44494,749,45267,081,0003,003,0002,359,296