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 17, 2026 19:42wnwnScore: 7,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:416,13074,280,54047,890,0002,993,0002,490,368
2Feb 17, 2026 19:426,14879,990,23849,028,0002,001,0002,506,752
3Feb 17, 2026 19:416,14874,571,74848,024,0003,001,0002,506,752
4Feb 17, 2026 19:426,16675,374,07948,166,0003,010,0002,478,080
5Feb 17, 2026 19:426,20074,234,56449,440,0002,017,0002,289,664
6Feb 17, 2026 19:416,24377,943,39249,822,0001,992,0002,482,176
7Feb 17, 2026 19:427,21584,043,08757,891,0001,996,0002,441,216
8Feb 17, 2026 19:417,36788,084,31958,138,0003,007,0002,482,176
9Feb 17, 2026 19:427,39689,942,64858,367,0003,019,0002,453,504
10Feb 17, 2026 19:417,40086,258,54258,397,0003,020,0002,396,160
11Feb 17, 2026 19:417,47494,915,89259,033,0003,001,0002,400,256
12Feb 17, 2026 19:427,53185,455,51960,488,0002,016,0002,400,256