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:59A_ShamanA_ShamanScore: 43,422Success
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:5942,664363,280,116272,002,00082,117,0002,113,536
2Jun 19, 2026 17:5942,916365,374,669272,069,00084,137,0002,113,536
3Jun 19, 2026 17:5942,925365,379,746272,107,00084,175,0002,113,536
4Jun 19, 2026 17:5943,178367,427,390273,482,00084,901,0002,113,536
5Jun 19, 2026 17:5943,422369,484,700273,191,00087,213,0002,113,536
6Jun 19, 2026 17:5943,423369,568,321273,448,00086,970,0002,113,536
7Jun 19, 2026 17:5943,446369,730,380273,368,00087,238,0002,113,536
8Jun 19, 2026 17:5943,465369,862,093273,515,00087,250,0002,113,536
9Jun 19, 2026 17:5943,529370,331,777273,235,00088,061,0002,113,536