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 17, 2026 10:45limanjun99limanjun99Score: 6,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:456,12078,493,92647,808,0002,988,0002,289,664
2Mar 17, 2026 10:456,12276,262,43447,826,0002,989,0002,289,664
3Mar 17, 2026 10:456,12482,513,21248,840,0001,993,0002,289,664
4Mar 17, 2026 10:456,12578,161,40648,848,0001,993,0002,482,176
5Mar 17, 2026 10:456,12677,440,59749,851,000997,0002,490,368
6Mar 17, 2026 10:456,13175,310,51548,893,0001,995,0002,289,664
7Mar 17, 2026 10:456,14775,372,70149,016,0002,000,0002,289,664
8Mar 17, 2026 10:456,16980,397,91148,193,0003,012,0002,482,176
9Mar 17, 2026 10:456,17275,127,32048,212,0003,013,0002,486,272