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 29, 2025 22:40Alexander KovalyovAlexander KovalyovScore: 52,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 22:4052,550457,845,144432,165,0004,001,0002,519,040
2Oct 29, 2025 22:4052,551461,806,385433,175,0003,001,0002,273,280
3Oct 29, 2025 22:4052,552458,899,714435,183,0001,000,0002,379,776
4Oct 29, 2025 22:4052,552465,347,872434,185,0002,000,0002,265,088
5Oct 29, 2025 22:4052,563461,355,432436,274,00002,396,160
6Oct 29, 2025 22:4052,573466,675,846435,355,0001,000,0002,273,280
7Oct 29, 2025 22:4052,574464,271,278435,362,0001,000,0002,273,280
8Oct 29, 2025 22:4052,588461,669,456436,483,00002,379,776
9Oct 29, 2025 22:4052,590464,168,076433,497,0002,996,0002,265,088