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 23, 2026 12:56maomao9-0maomao9-0Score: 48,763Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 12:5748,717414,147,800402,317,0002,040,0002,113,536
2Jun 23, 2026 12:5748,722413,729,835403,395,0001,005,0002,113,536
3Jun 23, 2026 12:5748,730413,712,355402,449,0002,016,0002,113,536
4Jun 23, 2026 12:5748,751413,894,791403,637,0001,004,0002,113,536
5Jun 23, 2026 12:5748,763414,079,938402,708,0002,029,0002,113,536
6Jun 23, 2026 12:5748,767414,199,838402,752,0002,016,0002,113,536
7Jun 23, 2026 12:5748,780418,447,955402,818,0002,064,0002,113,536
8Jun 23, 2026 12:5748,840415,156,664403,340,0002,033,0002,113,536
9Jun 23, 2026 12:5748,878415,499,988403,638,0002,055,0002,113,536