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 12:28Victor MerckléVictor MerckléScore: 88,431Success
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 12:2887,888737,868,130728,337,0001,135,0002,117,632stderr
2Jul 9, 2026 12:2887,926737,682,420728,702,0001,085,0002,117,632stderr
3Jul 9, 2026 12:2887,997738,476,625729,347,0001,033,0002,117,632stderr
4Jul 9, 2026 12:2888,427742,027,378732,919,0001,028,0002,117,632stderr
5Jul 9, 2026 12:2888,431741,941,295732,882,0001,102,0002,117,632stderr
6Jul 9, 2026 12:2888,467742,432,813733,266,0001,018,0002,117,632stderr
7Jul 9, 2026 12:2888,646743,712,572734,720,0001,042,0002,117,632stderr
8Jul 9, 2026 12:2889,097747,463,906738,455,0001,053,0002,117,632stderr
9Jul 9, 2026 12:2889,115747,638,018738,558,0001,102,0002,117,632stderr