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 listFeb 20, 2026 01:01Mikołaj UzarskiMikołaj UzarskiScore: 5,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 01:015,44767,895,62140,191,0005,023,0002,465,792
2Feb 20, 2026 01:015,50072,773,99442,606,0003,043,0002,338,816
3Feb 20, 2026 01:195,57969,660,81339,258,0007,046,0002,453,504
4Feb 20, 2026 01:015,60873,091,00940,476,0006,071,0002,392,064
5Feb 20, 2026 01:195,65170,174,73340,914,0005,987,0002,441,216
6Feb 20, 2026 01:195,67769,705,62039,099,0008,020,0002,469,888