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 2, 2025 20:39Jack FrigaardJack FrigaardScore: 4,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:394,83663,006,22837,128,0003,010,0002,281,472
2Aug 2, 2025 20:394,83962,879,96138,152,0002,008,0002,277,376
3Aug 2, 2025 20:394,84066,983,91238,167,0002,008,0002,281,472
4Aug 2, 2025 20:394,99064,452,65539,400,0002,020,0002,473,984
5Aug 2, 2025 20:394,99369,414,49440,429,0001,010,0002,473,984
6Aug 2, 2025 20:394,99364,225,13239,423,0002,021,0002,281,472