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 24, 2026 21:49Mikołaj UzarskiMikołaj UzarskiScore: 5,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:495,31973,091,38642,141,0002,006,0002,281,472
2Feb 24, 2026 21:495,32666,267,43642,196,0002,009,0002,355,200
3Feb 24, 2026 21:495,33166,488,39442,233,0002,011,0002,281,472
4Feb 24, 2026 21:495,33273,095,05242,243,0002,011,0002,498,560
5Feb 24, 2026 21:495,35266,594,21343,410,0001,009,0002,514,944
6Feb 24, 2026 21:495,35367,860,86943,418,0001,009,0002,285,568
7Feb 24, 2026 21:495,35371,693,83943,425,0001,009,0002,281,472
8Feb 24, 2026 21:495,38377,320,89643,667,0001,015,0002,510,848
9Feb 24, 2026 21:495,39970,984,11042,819,0001,991,0002,359,296
10Feb 24, 2026 21:495,40266,917,64243,841,000996,0002,289,664
11Feb 24, 2026 21:495,40571,741,22142,867,0001,993,0002,506,752
12Feb 24, 2026 21:495,40568,497,47940,877,0003,988,0002,502,656