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 listJul 12, 2026 12:28Kevin HeaveyKevin HeaveyScore: 5,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 12:365,64956,563,94245,862,0001,029,0002,117,632
2Jul 12, 2026 12:365,65556,562,48345,717,0001,224,0002,117,632
3Jul 12, 2026 12:365,67258,100,41346,050,0001,031,0002,117,632
4Jul 12, 2026 12:365,68265,522,54646,129,0001,033,0002,117,632
5Jul 12, 2026 12:365,69156,842,84146,207,0001,034,0002,117,632
6Jul 12, 2026 12:365,69857,039,54446,280,0001,015,0002,117,632
7Jul 12, 2026 12:365,73057,091,85946,536,0001,029,0002,117,632
8Jul 12, 2026 12:365,80657,819,62947,159,0001,032,0002,117,632
9Jul 12, 2026 12:365,88058,437,56347,783,0001,027,0002,117,632