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:25Jamal AbdulovJamal AbdulovScore: 391,900Success
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:26391,6983,260,929,9993,183,008,00068,087,0002,113,536
2Jun 26, 2026 12:26391,7923,261,566,8703,181,814,00070,066,0002,113,536
3Jun 26, 2026 12:26391,8213,261,967,2143,182,063,00070,052,0002,113,536
4Jun 26, 2026 12:26391,8563,261,802,0403,182,349,00070,057,0002,113,536
5Jun 26, 2026 12:26391,9003,262,256,1703,180,606,00072,167,0002,113,536
6Jun 26, 2026 12:26392,0213,263,186,3383,185,712,00068,069,0002,113,536
7Jun 26, 2026 12:26392,3863,266,672,8993,187,643,00069,161,0002,113,536
8Jun 26, 2026 12:26392,9543,271,044,3133,191,314,00070,206,0002,113,536
9Jun 26, 2026 12:26413,7113,443,129,0743,363,729,00070,075,0002,113,536