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 7, 2024 17:31GraceGraceScore: 42,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 17:3141,906414,777,784347,820,70802,269,184
2Jun 7, 2024 17:3141,956408,885,688348,235,83202,277,376
3Jun 7, 2024 17:3141,989401,067,801348,511,10002,269,184
4Jun 7, 2024 17:3142,005409,427,547348,638,65502,265,088
5Jun 7, 2024 17:3142,015414,652,740348,722,67302,269,184
6Jun 7, 2024 17:3142,067410,576,602349,157,63502,260,992
7Jun 7, 2024 17:3142,159403,221,908349,918,65502,277,376
8Jun 7, 2024 17:3142,161400,202,276349,940,17902,273,280
9Jun 7, 2024 17:3142,296429,068,444351,060,77002,392,064
10Jun 7, 2024 17:3143,008411,176,628356,970,39602,387,968
11Jun 7, 2024 17:3143,048435,060,888357,298,41602,265,088
12Jun 7, 2024 17:3143,261420,495,688359,063,04002,277,376