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:26A_ShamanA_ShamanScore: 61,012Success
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:2660,767513,490,941441,098,00063,276,0002,113,536
2Jun 19, 2026 16:2660,770513,435,529441,068,00063,326,0002,113,536
3Jun 19, 2026 16:2660,913516,095,003442,873,00062,706,0002,113,536
4Jun 19, 2026 16:2660,956515,034,827442,637,00063,306,0002,113,536
5Jun 19, 2026 16:2661,012515,665,338442,284,00064,123,0002,113,536
6Jun 19, 2026 16:2661,021515,589,149442,653,00063,828,0002,113,536
7Jun 19, 2026 16:2661,107516,233,047444,559,00062,636,0002,113,536
8Jun 19, 2026 16:2661,154516,688,212443,122,00064,463,0002,113,536
9Jun 19, 2026 16:2661,303517,910,115445,614,00063,204,0002,113,536