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 listAug 26, 2026 22:38Victor MerckléVictor MerckléScore: 3,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:393,72839,998,55529,836,0001,109,0002,113,536
2Aug 26, 2026 22:393,75739,548,26430,060,0001,130,0002,113,536
3Aug 26, 2026 22:393,76339,704,26930,077,0001,159,0002,113,536
4Aug 26, 2026 22:393,77339,432,59030,183,0001,136,0002,113,536
5Aug 26, 2026 22:393,79539,718,01530,441,0001,060,0002,113,536
6Aug 26, 2026 22:393,91740,733,80631,353,0001,159,0002,113,536
7Aug 26, 2026 22:393,92440,793,06131,514,0001,059,0002,113,536
8Aug 26, 2026 22:393,95541,823,16131,738,0001,090,0002,113,536
9Aug 26, 2026 22:394,16043,503,01633,450,0001,079,0002,113,536