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: 66,818Success
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:1866,629562,352,117487,603,00065,421,0002,113,536
2Jun 5, 2026 11:1866,640562,715,955487,923,00065,190,0002,113,536
3Jun 5, 2026 11:1866,657562,228,174488,202,00065,059,0002,113,536
4Jun 5, 2026 11:1866,751566,319,256488,864,00065,170,0002,113,536
5Jun 5, 2026 11:1866,818563,690,939487,484,00067,112,0002,113,536
6Jun 5, 2026 11:1866,824563,660,783488,440,00066,204,0002,113,536
7Jun 5, 2026 11:1866,834563,828,107488,620,00066,106,0002,113,536
8Jun 5, 2026 11:1866,867564,032,135488,859,00066,142,0002,113,536
9Jun 5, 2026 11:1867,433568,721,596488,505,00071,189,0002,113,536