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 listOct 22, 2026 16:25timothygktimothygkScore: 16,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:2516,623148,920,075106,054,00031,925,0002,117,632stderr
2Oct 22, 2026 16:2516,680149,454,479105,281,00033,171,0002,117,632stderr
3Oct 22, 2026 16:2516,725149,776,963105,681,00033,141,0002,117,632stderr
4Oct 22, 2026 16:2516,742149,994,072105,744,00033,221,0002,117,632stderr
5Oct 22, 2026 16:2516,821150,525,400106,374,00033,245,0002,117,632stderr
6Oct 22, 2026 16:2516,828150,548,643106,922,00032,752,0002,117,632stderr
7Oct 22, 2026 16:2516,908151,736,794106,464,00033,874,0002,117,632stderr
8Oct 22, 2026 16:2517,044152,903,027107,243,00034,227,0002,117,632stderr
9Oct 22, 2026 16:2517,050153,090,402106,867,00034,655,0002,117,632stderr