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 03:14Victor MerckléVictor MerckléScore: 4,209Success
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 03:164,17742,561,04733,606,0001,067,0002,113,536
2Jun 29, 2026 03:164,18342,678,07233,681,0001,039,0002,113,536
3Jun 29, 2026 03:164,19042,700,19633,764,0001,020,0002,113,536
4Jun 29, 2026 03:164,20342,790,41033,861,0001,032,0002,113,536
5Jun 29, 2026 03:164,20942,872,19333,888,0001,052,0002,113,536
6Jun 29, 2026 03:164,29643,361,25234,594,0001,067,0002,113,536
7Jun 29, 2026 03:164,30743,700,76434,668,0001,088,0002,113,536
8Jun 29, 2026 03:164,32443,593,10434,862,0001,035,0002,113,536
9Jun 29, 2026 03:164,42944,492,72635,755,0001,006,0002,113,536