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 listSep 6, 2026 10:15Kevin HeaveyKevin HeaveyScore: 3,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:183,53937,660,69328,163,0001,218,0002,113,536
2Sep 6, 2026 10:183,54137,661,17528,349,0001,043,0002,113,536
3Sep 6, 2026 10:183,54237,714,15028,347,0001,055,0002,113,536
4Sep 6, 2026 10:183,54437,687,39028,223,0001,194,0002,113,536
5Sep 6, 2026 10:183,54837,719,34028,266,0001,186,0002,113,536
6Sep 6, 2026 10:183,55537,831,12428,434,0001,075,0002,113,536
7Sep 6, 2026 10:183,63338,551,59129,111,0001,048,0002,113,536
8Sep 6, 2026 10:183,81439,925,86930,454,0001,205,0002,113,536
9Sep 6, 2026 10:183,83340,123,77730,806,0001,010,0002,113,536