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:51A_ShamanA_ShamanScore: 43,263Success
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:5343,047366,358,368267,040,00090,257,0002,113,536
2Jun 19, 2026 17:5343,148367,534,844267,102,00091,032,0002,113,536
3Jun 19, 2026 17:5343,181367,554,225267,344,00091,061,0002,113,536
4Jun 19, 2026 17:5343,192368,702,106267,787,00090,711,0002,113,536
5Jun 19, 2026 17:5343,263368,139,706267,813,00091,271,0002,113,536
6Jun 19, 2026 17:5343,277368,258,953267,096,00092,109,0002,113,536
7Jun 19, 2026 17:5343,342369,478,844267,499,00092,243,0002,113,536
8Jun 19, 2026 17:5343,450369,787,788268,556,00092,085,0002,113,536
9Jun 19, 2026 17:5343,643371,382,616267,718,00094,526,0002,113,536