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 22, 2026 23:45M-RochatM-RochatScore: 6,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:456,59665,908,27552,694,0002,061,0002,113,536
2May 22, 2026 23:456,60866,076,12852,778,0002,069,0002,113,536
3May 22, 2026 23:456,69766,891,38453,435,0002,153,0002,113,536
4May 22, 2026 23:456,70065,065,62753,441,0002,169,0002,113,536
5May 22, 2026 23:456,70465,500,22453,480,0002,171,0002,113,536
6May 22, 2026 23:456,70965,438,36953,556,0002,136,0002,113,536
7May 22, 2026 23:456,70967,608,35053,514,0002,172,0002,113,536
8May 22, 2026 23:456,72365,798,48753,621,0002,184,0002,113,536
9May 22, 2026 23:456,73368,822,28753,698,0002,191,0002,113,536