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 listMar 26, 2026 10:22Adam FolwarcznyAdam FolwarcznyScore: 10,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 09:2010,823119,681,30286,839,0002,994,0002,519,040
2Mar 26, 2026 09:2010,837115,191,69486,946,0002,998,0002,289,664
3Mar 26, 2026 10:2210,841118,200,21687,981,0001,999,0002,289,664
4Mar 26, 2026 09:2010,877117,816,22487,272,0003,009,0002,510,848
5Mar 26, 2026 10:2210,891114,621,84787,382,0003,013,0002,289,664
6Mar 26, 2026 10:2210,916114,939,70988,593,0002,013,0002,523,136