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 10, 2026 06:27Josu San MartinJosu San MartinScore: 4,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 06:274,09549,063,61632,895,0001,097,0002,482,176
2May 10, 2026 06:274,09652,590,82232,853,0001,152,0002,490,368
3May 10, 2026 06:274,09946,390,61432,889,0001,139,0002,478,080
4May 10, 2026 06:274,11149,033,35233,023,0001,106,0002,478,080
5May 10, 2026 06:274,12448,267,88733,118,0001,119,0002,494,464
6May 10, 2026 06:274,15051,651,68933,346,0001,106,0002,494,464
7May 10, 2026 06:274,21149,680,10433,895,0001,062,0002,482,176
8May 10, 2026 06:274,24552,574,35634,185,0001,052,0002,486,272
9May 10, 2026 06:274,26851,516,46534,407,0001,022,0002,490,368