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 listSep 14, 2026 10:56Victor MerckléVictor MerckléScore: 4,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:574,66557,149,13137,597,0001,124,0002,117,632stderr
2Sep 14, 2026 10:574,68957,232,07237,912,0001,013,0002,117,632stderr
3Sep 14, 2026 10:574,69048,731,19737,821,0001,113,0002,117,632stderr
4Sep 14, 2026 10:574,69460,435,51437,824,0001,143,0002,117,632stderr
5Sep 14, 2026 10:574,69557,155,28837,946,0001,025,0002,117,632stderr
6Sep 14, 2026 10:574,70449,542,72037,926,0001,118,0002,117,632stderr
7Sep 14, 2026 10:574,70957,982,78238,081,0001,011,0002,117,632stderr
8Sep 14, 2026 10:574,73849,738,86038,225,0001,107,0002,117,632stderr
9Sep 14, 2026 10:574,78758,860,91938,585,0001,153,0002,117,632stderr