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 listApr 25, 2026 04:00Charles CabergsCharles CabergsScore: 17,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 04:0217,643166,406,454145,436,0001,003,0002,363,392
2Apr 25, 2026 04:0217,669165,559,493144,659,0001,995,0002,428,928
3Apr 25, 2026 04:0217,674161,599,952144,706,0001,995,0002,310,144
4Apr 25, 2026 04:0217,675166,428,494144,711,0001,996,0002,310,144
5Apr 25, 2026 04:0217,680162,771,835144,755,0001,996,0002,310,144
6Apr 25, 2026 04:0217,691164,818,399144,846,0001,997,0002,367,488
7Apr 25, 2026 04:0217,695166,096,547144,876,0001,998,0002,375,680
8Apr 25, 2026 04:0218,087165,891,800148,125,0002,001,0002,359,296
9Apr 25, 2026 04:0218,098173,404,619149,218,0001,001,0002,363,392