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 28, 2021 14:17gchebanovgchebanovScore: 27,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 14:1727,761259,539,566228,422,0001,994,0002,383,872
2Jun 28, 2021 14:1727,804260,866,912228,779,0001,998,0002,260,992
3Jun 28, 2021 14:1727,806259,982,194228,790,0001,998,0002,260,992
4Jun 28, 2021 14:1727,820254,317,849229,907,000999,0002,260,992
5Jun 28, 2021 14:1727,832255,067,696229,008,0002,000,0002,527,232
6Jun 28, 2021 14:1727,868257,648,354230,306,0001,001,0002,523,136
7Jun 28, 2021 14:1727,881257,938,217231,416,00002,383,872
8Jun 28, 2021 14:1727,898256,645,663231,556,00002,396,160
9Jun 28, 2021 14:1728,086264,161,755231,114,0002,000,0002,387,968
10Jun 28, 2021 14:1728,778313,199,690238,859,45702,265,088
11Jun 28, 2021 14:1728,808300,039,850239,107,23402,277,376
12Jun 28, 2021 14:1729,170300,184,004242,115,10502,273,280