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 28, 2026 19:36Ondřej PolaneckýOndřej PolaneckýScore: 24,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:3623,703224,730,210181,753,00014,979,0002,273,280
2Mar 28, 2026 19:3624,036230,973,831187,468,00012,030,0002,306,048
3Mar 28, 2026 19:3624,649233,039,202193,556,00011,031,0002,351,104