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 listMar 13, 2026 09:24Dominique GarmierDominique GarmierScore: 72,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 09:2472,094622,807,159596,386,0001,997,0002,273,280
2Mar 13, 2026 09:2472,115626,690,635596,554,0001,998,0002,273,280
3Mar 13, 2026 09:2472,117625,192,558596,572,0001,998,0002,396,160
4Mar 13, 2026 09:2472,117624,917,680597,571,000999,0002,273,280
5Mar 13, 2026 09:2472,121630,079,345597,602,000999,0002,392,064
6Mar 13, 2026 09:2472,123631,654,216597,624,000999,0002,273,280
7Mar 13, 2026 09:2472,131624,812,341596,693,0001,998,0002,273,280
8Mar 13, 2026 09:2472,132626,945,967597,695,000999,0002,400,256
9Mar 13, 2026 09:2472,133630,734,251597,707,000999,0002,269,184
10Mar 13, 2026 09:2472,135626,093,577596,722,0001,999,0002,396,160
11Mar 13, 2026 09:2472,138631,018,817597,747,000999,0002,273,280
12Mar 13, 2026 09:2472,142624,716,901596,778,0001,999,0002,273,280