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 21:31javivallejojavivallejoScore: 57,522Success
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 21:3157,503505,897,818476,271,0001,000,0002,387,968
2Feb 2, 2026 21:3357,508501,180,887477,313,00002,510,848
3Feb 2, 2026 21:3357,514504,696,215475,364,0002,001,0002,387,968
4Feb 2, 2026 21:3157,522503,170,250477,433,00002,387,968
5Feb 2, 2026 21:3357,528508,519,988475,484,0002,002,0002,510,848
6Feb 2, 2026 21:3157,537504,189,255476,557,000999,0002,367,488