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 16, 2026 20:31Yuriy LyfenkoYuriy LyfenkoScore: 9,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 20:319,284105,137,13375,059,0002,001,0002,523,136
2Mar 16, 2026 20:319,287105,775,73475,084,0002,002,0002,265,088
3Mar 16, 2026 20:319,300102,791,30075,185,0002,004,0002,285,568