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 19, 2026 15:50A_ShamanA_ShamanScore: 64,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 15:5064,625545,543,464477,468,00058,923,0002,113,536
2Jun 19, 2026 15:5064,640545,508,758477,720,00058,799,0002,113,536
3Jun 19, 2026 15:5064,664545,745,564477,451,00059,261,0002,113,536
4Jun 19, 2026 15:5064,684545,923,302477,378,00059,506,0002,113,536
5Jun 19, 2026 15:5064,687546,057,042477,503,00059,403,0002,113,536
6Jun 19, 2026 15:5064,711546,293,226477,345,00059,757,0002,113,536
7Jun 19, 2026 15:5064,724546,335,066477,279,00059,934,0002,113,536
8Jun 19, 2026 15:5064,726546,262,753477,465,00059,761,0002,113,536
9Jun 19, 2026 15:5064,744546,448,782477,482,00059,901,0002,113,536