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 listFeb 8, 2026 06:17howenhowenScore: 88,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 06:1787,980759,109,956490,487,000239,749,0002,486,272
2Feb 8, 2026 06:1788,295765,340,197489,901,000242,951,0002,498,560
3Feb 8, 2026 06:1788,821765,037,082490,480,000246,738,0002,269,184