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 listJan 1, 2026 21:53Josu San MartinJosu San MartinScore: 8,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:518,34097,572,16066,214,0003,009,0002,482,176
2Jan 1, 2026 21:518,34293,961,39965,222,0004,013,0002,260,992
3Jan 1, 2026 21:518,35292,025,16165,301,0004,018,0002,265,088
4Jan 1, 2026 21:538,54492,604,72466,920,0003,995,0002,498,560
5Jan 1, 2026 21:538,54597,661,30367,931,0002,996,0002,482,176
6Jan 1, 2026 21:518,57992,351,12669,198,0002,005,0002,506,752
7Jan 1, 2026 21:518,58594,759,82470,255,0001,003,0002,490,368
8Jan 1, 2026 21:538,58795,249,10869,267,0002,007,0002,281,472
9Jan 1, 2026 21:518,60497,683,13268,397,0003,017,0002,478,080
10Jan 1, 2026 21:538,742103,029,48371,553,0001,007,0002,387,968
11Jan 1, 2026 21:538,77695,820,75669,851,0002,993,0002,473,984
12Jan 1, 2026 21:538,83896,750,73070,342,0003,014,0002,359,296