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 19, 2026 21:26Daniel MastalerzDaniel MastalerzScore: 5,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:265,71678,824,41244,415,0003,028,0002,277,376
2Feb 19, 2026 21:265,72174,554,28244,451,0003,030,0002,523,136
3Feb 19, 2026 21:265,74772,372,73144,656,0003,044,0002,326,528
4Feb 19, 2026 21:265,75475,227,73145,728,0002,032,0002,269,184
5Feb 19, 2026 21:265,76377,763,47145,843,0001,993,0002,310,144
6Feb 19, 2026 21:265,76376,632,62244,845,0002,989,0002,326,528
7Feb 19, 2026 21:265,76470,070,11343,858,0003,987,0002,281,472
8Feb 19, 2026 21:265,77673,563,45743,948,0003,995,0002,326,528
9Feb 19, 2026 21:265,79269,052,96344,069,0004,006,0002,310,144
10Feb 19, 2026 21:265,81973,980,56744,273,0004,024,0002,260,992
11Feb 19, 2026 21:265,83473,055,08145,400,0003,026,0002,269,184
12Feb 19, 2026 21:265,86077,656,18245,598,0003,039,0002,289,664