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 10:09Dominique GarmierDominique GarmierScore: 32,590Success
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 10:0932,262296,137,126266,773,000999,0002,273,280
2Mar 13, 2026 10:0932,263293,716,630266,787,000999,0002,273,280
3Mar 13, 2026 10:0932,271296,747,707265,849,0001,998,0002,273,280
4Mar 13, 2026 10:0932,586299,542,631270,462,00002,269,184
5Mar 13, 2026 10:0932,590301,566,338269,498,0001,001,0002,273,280
6Mar 13, 2026 10:0932,616296,048,335269,715,000998,0002,273,280
7Mar 13, 2026 10:0932,628302,099,195268,812,0001,998,0002,273,280
8Mar 13, 2026 10:0932,658294,185,294269,064,0002,000,0002,273,280
9Mar 13, 2026 10:0932,681292,846,530271,254,00002,396,160