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 17:38A_ShamanA_ShamanScore: 45,157Success
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 17:3844,435377,964,700286,298,00082,515,0002,113,536
2Jun 19, 2026 17:3844,853381,434,125287,133,00085,151,0002,113,536
3Jun 19, 2026 17:3844,855382,030,903286,534,00085,768,0002,113,536
4Jun 19, 2026 17:3845,136383,726,640289,406,00085,229,0002,113,536
5Jun 19, 2026 17:3845,157383,857,617289,491,00085,314,0002,113,536
6Jun 19, 2026 17:3845,172384,021,683288,530,00086,401,0002,113,536
7Jun 19, 2026 17:3845,332385,338,363288,627,00087,636,0002,113,536
8Jun 19, 2026 17:3845,448386,351,487288,949,00088,272,0002,113,536
9Jun 19, 2026 17:3845,574387,464,631290,122,00088,146,0002,113,536