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, 2026 14:25TonyTonyScore: 40,464Success
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, 2026 14:2540,303344,579,543301,287,00033,231,0002,113,536
2Aug 2, 2026 14:2540,440348,220,446301,581,00034,074,0002,113,536
3Aug 2, 2026 14:2540,448345,808,464302,437,00033,285,0002,113,536
4Aug 2, 2026 14:2540,450346,549,076302,516,00033,221,0002,113,536
5Aug 2, 2026 14:2540,464345,935,012302,680,00033,172,0002,113,536
6Aug 2, 2026 14:2540,500347,091,044301,981,00034,173,0002,113,536
7Aug 2, 2026 14:2540,501346,337,133301,505,00034,656,0002,113,536
8Aug 2, 2026 14:2540,535347,225,989303,053,00033,390,0002,113,536
9Aug 2, 2026 14:2540,552346,673,078303,077,00033,512,0002,113,536