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 17, 2026 00:27Victor MerckléVictor MerckléScore: 37,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:2836,922316,368,723305,350,0001,110,0002,117,632stderr
2Sep 17, 2026 00:2836,992316,949,868305,947,0001,091,0002,117,632stderr
3Sep 17, 2026 00:2837,041317,352,386306,444,0001,000,0002,117,632stderr
4Sep 17, 2026 00:2837,078317,624,811306,672,0001,077,0002,117,632stderr
5Sep 17, 2026 00:2837,082317,722,142306,688,0001,093,0002,117,632stderr
6Sep 17, 2026 00:2837,117317,929,655306,996,0001,081,0002,117,632stderr
7Sep 17, 2026 00:2837,121317,949,116307,101,0001,006,0002,117,632stderr
8Sep 17, 2026 00:2837,185318,586,416307,546,0001,094,0002,117,632stderr
9Sep 17, 2026 00:2837,238319,000,651308,061,0001,017,0002,117,632stderr