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 listJun 26, 2026 12:32Jamal AbdulovJamal AbdulovScore: 523,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:35522,7594,348,113,1534,275,867,00063,036,0002,113,536
2Jun 26, 2026 12:35523,1324,351,201,4424,279,947,00062,051,0002,113,536
3Jun 26, 2026 12:35523,5714,354,859,7514,282,600,00063,045,0002,113,536
4Jun 26, 2026 12:35523,6694,355,781,5074,281,408,00065,047,0002,113,536
5Jun 26, 2026 12:35523,8164,356,998,4504,284,631,00063,045,0002,113,536
6Jun 26, 2026 12:35523,9584,358,005,6644,283,641,00065,217,0002,113,536
7Jun 26, 2026 12:35524,3714,361,473,9714,287,086,00065,201,0002,113,536
8Jun 26, 2026 12:35524,5504,363,034,5014,290,713,00063,053,0002,113,536
9Jun 26, 2026 12:35525,1734,368,000,9234,294,894,00064,044,0002,113,536