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 10, 2025 13:16Sean McLoughlinSean McLoughlinScore: 2,066,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2025 13:162,064,68817,172,819,96217,069,941,00066,968,0002,277,376
2Jun 10, 2025 13:162,065,36417,173,114,64817,077,545,00064,975,0002,277,376
3Jun 10, 2025 13:162,065,58717,176,979,71317,075,398,00068,973,0002,265,088
4Jun 10, 2025 13:162,065,81917,181,385,93017,093,323,00052,976,0002,285,568
5Jun 10, 2025 13:162,066,42917,184,768,67917,075,409,00075,952,0002,277,376
6Jun 10, 2025 13:162,066,53517,186,624,18817,083,273,00068,968,0002,277,376
7Jun 10, 2025 13:162,066,69117,184,543,69917,078,570,00074,963,0002,277,376
8Jun 10, 2025 13:162,071,46617,227,919,62917,122,204,00070,967,0002,265,088
9Jun 10, 2025 13:162,072,30817,234,725,50817,145,178,00054,978,0002,277,376