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 listJan 11, 2026 13:05Pavel SkripkinPavel SkripkinScore: 39,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 13:0539,479354,277,562325,678,0001,998,0002,433,024
2Jan 11, 2026 13:0539,480357,413,100325,685,0001,998,0002,281,472
3Jan 11, 2026 13:0539,493351,207,758325,794,0001,998,0002,441,216
4Jan 11, 2026 13:0539,499352,806,231325,843,0001,999,0002,441,216
5Jan 11, 2026 13:0539,500355,151,084325,855,0001,999,0002,277,376
6Jan 11, 2026 13:0539,999356,740,718329,991,0001,999,0002,441,216
7Jan 11, 2026 13:0540,531363,144,206336,410,00002,543,616
8Jan 11, 2026 13:0540,533358,763,117335,420,0001,001,0002,281,472
9Jan 11, 2026 13:0540,585357,182,732334,860,0001,999,0002,543,616