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 26, 2026 23:36Ondřej PolaneckýOndřej PolaneckýScore: 15,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:3615,015152,869,352123,621,0001,005,0002,273,280
2Mar 26, 2026 23:3615,114150,019,048125,443,00002,269,184
3Mar 26, 2026 23:3615,241149,901,515126,504,00002,269,184