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 15, 2026 16:01Sriram SamiSriram SamiScore: 10,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:0110,092109,995,33880,774,0002,991,0002,310,144
2Mar 15, 2026 16:0110,129106,767,91582,071,0002,001,0002,494,464
3Mar 15, 2026 16:0110,145106,980,22481,200,0003,007,0002,326,528
4Mar 15, 2026 16:0110,162109,317,12280,325,0004,016,0002,269,184
5Mar 15, 2026 16:0110,167106,872,01381,372,0003,013,0002,498,560
6Mar 15, 2026 16:0110,336113,187,56179,801,0005,985,0002,473,984
7Mar 15, 2026 16:0110,373110,631,19083,091,0003,003,0002,408,448
8Mar 15, 2026 16:0110,401108,232,21881,313,0005,019,0002,318,336
9Mar 15, 2026 16:0110,416114,642,92283,440,0003,015,0002,445,312