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 25, 2026 11:26Victor MerckléVictor MerckléScore: 4,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 11:274,19042,904,31933,680,0001,097,0002,113,536
2Jun 25, 2026 11:274,20342,953,42533,761,0001,124,0002,113,536
3Jun 25, 2026 11:274,20542,917,60233,802,0001,107,0002,113,536
4Jun 25, 2026 11:274,20942,551,04233,872,0001,065,0002,113,536
5Jun 25, 2026 11:274,21042,578,38733,869,0001,077,0002,113,536
6Jun 25, 2026 11:274,21142,585,58933,877,0001,076,0002,113,536
7Jun 25, 2026 11:274,21242,979,83633,872,0001,094,0002,113,536
8Jun 25, 2026 11:274,26943,112,22634,340,0001,095,0002,113,536
9Jun 25, 2026 11:274,35444,982,09035,067,0001,072,0002,113,536