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 9, 2026 10:15Victor MerckléVictor MerckléScore: 68,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 10:1567,638569,445,725560,362,0001,037,0002,117,632stderr
2Jul 9, 2026 10:1567,641569,281,871560,379,0001,049,0002,117,632stderr
3Jul 9, 2026 10:1567,808572,226,737561,801,0001,007,0002,117,632stderr
4Jul 9, 2026 10:1567,955572,078,600563,030,0001,004,0002,117,632stderr
5Jul 9, 2026 10:1568,000572,493,293563,331,0001,075,0002,117,632stderr
6Jul 9, 2026 10:1568,031572,550,833563,590,0001,074,0002,117,632stderr
7Jul 9, 2026 10:1568,289574,687,789565,773,0001,030,0002,117,632stderr
8Jul 9, 2026 10:1568,575577,380,581568,012,0001,167,0002,117,632stderr
9Jul 9, 2026 10:1568,684578,263,452568,940,0001,144,0002,117,632stderr