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 10, 2026 12:03Victor MerckléVictor MerckléScore: 14,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:0514,023123,952,668115,327,0001,069,0002,117,632stderr
2Jun 10, 2026 12:0514,114124,612,016116,061,0001,093,0002,117,632stderr
3Jun 10, 2026 12:0514,175125,281,825116,574,0001,085,0002,117,632stderr
4Jun 10, 2026 12:0514,325126,347,603117,832,0001,071,0002,117,632stderr
5Jun 10, 2026 12:0514,334126,531,715117,831,0001,148,0002,117,632stderr
6Jun 10, 2026 12:0514,350126,682,247118,092,0001,016,0002,117,632stderr
7Jun 10, 2026 12:0514,517128,034,551119,403,0001,094,0002,117,632stderr
8Jun 10, 2026 12:0514,836130,912,724122,141,0001,002,0002,117,632stderr
9Jun 10, 2026 12:0514,877131,042,075122,461,0001,026,0002,117,632stderr