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 listOct 22, 2025 13:07caandocaandoScore: 6,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 13:075,94980,594,42048,368,0001,007,0002,260,992
2Oct 22, 2025 13:075,95072,515,09648,375,0001,007,0002,285,568
3Oct 22, 2025 13:075,98974,401,31448,697,0001,014,0002,273,280
4Oct 22, 2025 13:076,05372,361,40048,234,0002,009,0002,285,568
5Oct 22, 2025 13:076,09583,538,57850,591,00002,285,568
6Oct 22, 2025 13:076,10477,528,17249,654,0001,013,0002,285,568