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 listJun 29, 2026 10:07Adam FolwarcznyAdam FolwarcznyScore: 14,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 10:0814,498129,675,891119,179,0001,156,0002,113,536
2Jun 29, 2026 10:0814,522129,882,744119,373,0001,164,0002,113,536
3Jun 29, 2026 10:0814,976133,708,357123,147,0001,162,0002,113,536
4Jun 29, 2026 10:0814,976133,629,374123,148,0001,161,0002,113,536
5Jun 29, 2026 10:0814,988133,708,909123,249,0001,159,0002,113,536
6Jun 29, 2026 10:0815,041135,364,940123,659,0001,184,0002,113,536
7Jun 29, 2026 10:0815,043134,220,524123,709,0001,155,0002,113,536
8Jun 29, 2026 10:0815,046134,233,212123,743,0001,147,0002,113,536
9Jun 29, 2026 10:0815,046134,302,286123,722,0001,167,0002,113,536