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 listAug 11, 2025 02:15RyhbtRyhbtScore: 53,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 02:1553,846468,651,113444,923,0001,999,0002,527,232
2Aug 11, 2025 02:1553,867466,345,358446,093,0001,000,0002,531,328
3Aug 11, 2025 02:1553,884473,334,965447,237,00002,424,832
4Aug 11, 2025 02:1553,889468,684,842447,280,00002,424,832
5Aug 11, 2025 02:1553,892472,526,829445,305,0002,001,0002,428,928
6Aug 11, 2025 02:1553,897481,177,125447,349,00002,531,328
7Aug 11, 2025 02:1553,898469,583,678445,357,0001,997,0002,531,328
8Aug 11, 2025 02:1553,906472,735,924445,416,0002,001,0002,428,928
9Aug 11, 2025 02:1553,914474,125,175444,488,0002,996,0002,269,184