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 30, 2026 12:21Saif Al-HarthiSaif Al-HarthiScore: 30,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 12:2130,687264,075,159191,274,00063,431,0002,117,632
2Jun 30, 2026 12:2130,692264,116,721191,514,00063,231,0002,117,632
3Jun 30, 2026 12:2130,762264,748,918191,336,00063,991,0002,117,632
4Jun 30, 2026 12:2130,788265,278,163191,321,00064,225,0002,117,632
5Jun 30, 2026 12:2130,799265,044,620191,267,00064,370,0002,117,632
6Jun 30, 2026 12:2130,807265,094,158191,516,00064,184,0002,117,632
7Jun 30, 2026 12:2130,885265,759,059191,712,00064,639,0002,117,632
8Jun 30, 2026 12:2130,917265,984,157192,560,00064,055,0002,117,632
9Jun 30, 2026 12:2131,023266,856,218192,523,00064,972,0002,117,632