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 listMay 24, 2026 16:58Victor MerckléVictor MerckléScore: 8,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 16:598,61879,499,95670,474,0001,056,0002,113,536
2May 24, 2026 16:598,61979,391,15770,476,0001,068,0002,113,536
3May 24, 2026 16:598,63081,942,84170,581,0001,056,0002,113,536
4May 24, 2026 16:598,63179,469,16970,569,0001,075,0002,113,536
5May 24, 2026 16:598,63281,417,90270,579,0001,067,0002,113,536
6May 24, 2026 16:598,63880,908,54070,615,0001,081,0002,113,536
7May 24, 2026 16:598,66880,081,44570,925,0001,020,0002,113,536
8May 24, 2026 16:598,67279,774,43670,979,0001,003,0002,113,536
9May 24, 2026 16:598,88781,605,70872,730,0001,038,0002,113,536