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 listJul 7, 2026 11:41Kevin HeaveyKevin HeaveyScore: 4,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:424,53847,258,32436,517,0001,153,0002,117,632
2Jul 7, 2026 11:424,54247,448,50036,537,0001,168,0002,117,632
3Jul 7, 2026 11:424,59747,751,53136,996,0001,163,0002,117,632
4Jul 7, 2026 11:424,60847,847,82237,082,0001,172,0002,117,632
5Jul 7, 2026 11:424,63848,112,62437,321,0001,178,0002,117,632
6Jul 7, 2026 11:424,65048,194,48337,436,0001,160,0002,117,632
7Jul 7, 2026 11:424,66948,283,96937,576,0001,178,0002,117,632
8Jul 7, 2026 11:424,70748,619,68537,901,0001,169,0002,117,632
9Jul 7, 2026 11:424,83949,766,77039,004,0001,164,0002,117,632