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 listAug 30, 2026 20:17Josu San MartinJosu San MartinScore: 6,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:196,75364,584,81034,880,00021,177,0002,113,536
2Aug 30, 2026 20:196,75664,480,68334,935,00021,147,0002,113,536
3Aug 30, 2026 20:196,76864,652,30734,915,00021,264,0002,113,536
4Aug 30, 2026 20:196,77164,635,38435,060,00021,147,0002,113,536
5Aug 30, 2026 20:196,78464,871,75134,936,00021,379,0002,113,536
6Aug 30, 2026 20:196,81365,096,51235,187,00021,368,0002,113,536
7Aug 30, 2026 20:196,81865,109,74635,180,00021,414,0002,113,536
8Aug 30, 2026 20:196,84165,199,27235,619,00021,169,0002,113,536
9Aug 30, 2026 20:196,91765,883,86336,249,00021,164,0002,113,536