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 30, 2026 10:11parastromparastromScore: 3,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 10:123,85040,908,19630,901,0001,058,0002,113,536
2Sep 30, 2026 10:123,87341,089,15431,093,0001,059,0002,113,536
3Sep 30, 2026 10:123,88441,211,35331,187,0001,051,0002,113,536
4Sep 30, 2026 10:123,89641,351,37231,204,0001,134,0002,113,536
5Sep 30, 2026 10:123,91341,351,01931,436,0001,045,0002,113,536
6Sep 30, 2026 10:123,94041,711,73631,534,0001,170,0002,113,536
7Sep 30, 2026 10:123,96943,790,99431,800,0001,145,0002,113,536
8Sep 30, 2026 10:123,97542,092,66531,861,0001,136,0002,113,536
9Sep 30, 2026 10:124,14043,363,30733,221,0001,145,0002,113,536