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 listFeb 2, 2026 20:44javivallejojavivallejoScore: 50,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 20:4450,937450,114,477420,781,0001,998,0002,277,376
2Feb 2, 2026 20:4450,942451,718,678421,817,000999,0002,269,184
3Feb 2, 2026 20:4450,944459,464,900419,834,0002,998,0002,277,376
4Feb 2, 2026 20:4450,945453,731,900418,847,0003,998,0002,277,376
5Feb 2, 2026 20:4450,957454,686,736419,940,0002,999,0002,277,376
6Feb 2, 2026 20:4450,959447,573,751420,962,0001,999,0002,281,472
7Feb 2, 2026 20:4450,979449,790,064421,128,0002,000,0002,277,376
8Feb 2, 2026 20:4450,995445,690,182422,259,0001,000,0002,277,376
9Feb 2, 2026 20:4450,997448,666,266422,272,0001,000,0002,277,376