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 16:12A_ShamanA_ShamanScore: 57,730Success
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 16:1357,639487,601,410416,062,00062,344,0002,113,536
2Jun 19, 2026 16:1357,685487,911,802415,776,00063,017,0002,113,536
3Jun 19, 2026 16:1357,700487,956,453416,302,00062,611,0002,113,536
4Jun 19, 2026 16:1357,723488,272,447415,954,00063,154,0002,113,536
5Jun 19, 2026 16:1357,730488,469,731416,321,00062,844,0002,113,536
6Jun 19, 2026 16:1357,762488,571,345415,364,00064,066,0002,113,536
7Jun 19, 2026 16:1357,763488,483,368415,799,00063,635,0002,113,536
8Jun 19, 2026 16:1357,837489,217,702416,164,00063,888,0002,113,536
9Jun 19, 2026 16:1357,875489,496,115416,294,00064,076,0002,113,536