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 listMar 13, 2026 12:49Eric CeglieEric CeglieScore: 27,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:3227,856258,735,429231,203,00002,260,992
2Mar 13, 2026 12:4927,874256,093,259231,354,00002,260,992
3Mar 13, 2026 14:3227,874256,795,485230,351,0001,001,0002,383,872
4Mar 13, 2026 14:3227,877256,659,110231,383,00002,519,040
5Mar 13, 2026 12:4927,889258,296,991230,477,0001,002,0002,256,896
6Mar 13, 2026 12:4928,047262,603,559228,793,0003,996,0002,260,992