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 5, 2026 11:18chereshnya123chereshnya123Score: 72,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:1972,206608,407,605535,147,00064,168,0002,113,536
2Jun 5, 2026 11:1972,269608,909,750534,706,00065,134,0002,113,536
3Jun 5, 2026 11:1972,319609,345,704535,007,00065,241,0002,113,536
4Jun 5, 2026 11:1972,328609,444,268535,149,00065,174,0002,113,536
5Jun 5, 2026 11:1972,379609,773,535535,545,00065,206,0002,113,536
6Jun 5, 2026 11:1972,453610,578,528535,163,00066,197,0002,113,536
7Jun 5, 2026 11:1972,511610,924,551534,729,00067,119,0002,113,536
8Jun 5, 2026 11:1972,619611,825,499534,656,00068,084,0002,113,536
9Jun 5, 2026 11:1972,656612,151,484534,889,00068,161,0002,113,536