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 24, 2026 02:51Alyssa VerkadeAlyssa VerkadeScore: 37,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 02:5137,716340,063,419311,039,0002,000,0002,363,392
2Mar 23, 2026 22:3237,727334,708,552312,131,0001,000,0002,367,488
3Mar 23, 2026 22:3237,730337,087,441312,156,0001,000,0002,289,664
4Mar 23, 2026 22:3237,737335,084,444313,221,00002,289,664
5Mar 23, 2026 22:3237,747339,212,710313,301,00002,351,104
6Mar 23, 2026 22:3237,747334,231,477313,303,00002,355,200
7Mar 23, 2026 22:3237,761342,918,029312,418,0001,001,0002,465,792
8Mar 24, 2026 02:5137,782343,699,731311,595,0001,997,0002,359,296
9Mar 23, 2026 22:3237,792343,222,506313,674,00002,363,392
10Mar 23, 2026 22:3237,793339,978,441311,684,0001,997,0002,289,664
11Mar 23, 2026 22:3237,796339,977,601312,705,000999,0002,363,392
12Mar 24, 2026 02:5137,809338,173,606312,817,000999,0002,359,296