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 21, 2026 20:32A_ShamanA_ShamanScore: 56,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:3356,724479,939,991407,909,00062,903,0002,113,536
2Jun 21, 2026 20:3356,743481,710,679407,705,00063,265,0002,113,536
3Jun 21, 2026 20:3356,780480,387,562408,522,00062,752,0002,113,536
4Jun 21, 2026 20:3356,841482,120,607408,508,00063,273,0002,113,536
5Jun 21, 2026 20:3356,877481,269,322408,156,00063,926,0002,113,536
6Jun 21, 2026 20:3356,900481,349,804408,360,00063,914,0002,113,536
7Jun 21, 2026 20:3356,923481,627,568408,537,00063,927,0002,113,536
8Jun 21, 2026 20:3356,963481,908,761408,718,00064,075,0002,113,536
9Jun 21, 2026 20:3356,974482,064,088409,263,00063,627,0002,113,536