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 21, 2026 21:49M-RochatM-RochatScore: 6,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:496,92468,995,65655,435,0002,041,0002,113,536
2May 21, 2026 21:496,93168,865,03555,462,0002,070,0002,113,536
3May 21, 2026 21:496,93269,937,01955,397,0002,146,0002,113,536
4May 21, 2026 21:496,93968,759,33055,529,0002,069,0002,113,536
5May 21, 2026 21:496,94168,461,53455,548,0002,066,0002,113,536
6May 21, 2026 21:497,01269,068,79556,068,0002,134,0002,113,536
7May 21, 2026 21:497,02069,555,90156,119,0002,155,0002,113,536
8May 21, 2026 21:497,02670,463,74056,147,0002,173,0002,113,536
9May 21, 2026 21:497,02969,065,79856,159,0002,184,0002,113,536