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 listDec 1, 2025 19:09Rajarshi BasuRajarshi BasuScore: 12,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:0912,287127,551,55399,980,0001,999,0002,289,664
2Dec 1, 2025 19:0912,299125,528,445100,079,0002,001,0002,289,664
3Dec 1, 2025 19:0912,308128,708,725101,158,0001,001,0002,289,664
4Dec 1, 2025 19:0912,328130,967,438101,316,0001,003,0002,289,664
5Dec 1, 2025 19:0912,390133,804,450100,843,0001,996,0002,289,664
6Dec 1, 2025 19:0912,407136,595,504100,982,0001,999,0002,383,872
7Dec 1, 2025 19:0912,408127,604,362101,984,000999,0002,387,968
8Dec 1, 2025 19:0912,423134,729,646100,105,0003,003,0002,375,680
9Dec 1, 2025 19:0912,446126,193,184100,291,0003,008,0002,465,792