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 15, 2026 14:42shartgepettoshartgepettoScore: 12,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:4212,570128,235,707100,317,0004,012,0002,273,280
2Mar 15, 2026 14:4212,570126,491,859100,319,0004,012,0002,273,280
3Mar 15, 2026 14:4212,575128,225,564101,362,0003,010,0002,277,376
4Mar 15, 2026 14:4212,581134,694,720102,413,0002,008,0002,289,664
5Mar 15, 2026 14:4212,604137,734,643101,599,0003,017,0002,400,256
6Mar 15, 2026 14:4212,622129,807,187100,769,0003,990,0002,273,280
7Mar 15, 2026 14:4212,630133,246,764100,838,0003,993,0002,289,664
8Mar 15, 2026 14:4212,638129,232,139100,898,0003,995,0002,260,992
9Mar 15, 2026 14:4212,691127,976,635102,327,0003,009,0002,265,088