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:46Dominique GarmierDominique GarmierScore: 61,171Success
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:4660,950530,120,441503,887,0001,999,0002,273,280
2Mar 13, 2026 09:4660,969528,885,319505,043,0001,000,0002,387,968
3Mar 13, 2026 09:4661,037531,949,030504,608,0001,998,0002,396,160
4Mar 13, 2026 09:4661,039532,852,418505,626,000999,0002,273,280
5Mar 13, 2026 09:4661,171530,983,147506,720,000999,0002,269,184
6Mar 13, 2026 09:4661,300538,158,121506,793,0001,999,0002,269,184
7Mar 13, 2026 09:4661,327537,128,753508,014,0001,000,0002,392,064
8Mar 13, 2026 09:4661,447540,413,114508,009,0002,000,0002,273,280
9Mar 13, 2026 09:4661,449538,677,743509,025,0001,000,0002,273,280