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 15, 2026 07:50Victor MerckléVictor MerckléScore: 6,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 07:506,97466,050,81557,886,00002,113,536
2May 15, 2026 07:506,97566,467,18357,894,00002,113,536
3May 15, 2026 07:506,97665,869,10957,904,00002,113,536
4May 15, 2026 07:506,98067,289,34256,927,0001,009,0002,113,536
5May 15, 2026 07:506,98665,497,36556,973,0001,019,0002,113,536
6May 15, 2026 07:507,02767,363,55858,326,00002,113,536
7May 15, 2026 07:507,03167,983,89458,362,00002,113,536
8May 15, 2026 07:507,03266,746,67657,331,0001,039,0002,113,536
9May 15, 2026 07:507,07666,262,10858,733,00002,113,536