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 23, 2026 09:04Kevin HeaveyKevin HeaveyScore: 3,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 09:073,23935,546,88825,834,0001,056,0002,113,536
2Sep 23, 2026 09:073,24236,472,02925,893,0001,020,0002,113,536
3Sep 23, 2026 09:073,24936,549,34425,942,0001,028,0002,113,536
4Sep 23, 2026 09:073,25036,610,59525,947,0001,031,0002,113,536
5Sep 23, 2026 09:073,25035,631,47725,743,0001,235,0002,113,536
6Sep 23, 2026 09:073,25436,678,03825,971,0001,042,0002,113,536
7Sep 23, 2026 09:073,25436,637,69425,800,0001,216,0002,113,536
8Sep 23, 2026 09:073,25935,933,61626,035,0001,017,0002,113,536
9Sep 23, 2026 09:073,26536,718,72525,942,0001,164,0002,113,536