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 20, 2026 18:19Daniel MastalerzDaniel MastalerzScore: 5,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 18:195,65568,865,77242,940,0003,994,0002,400,256
2Feb 20, 2026 18:195,79968,075,06944,123,0004,011,0002,306,048
3Feb 20, 2026 18:195,80974,704,14844,200,0004,018,0002,322,432
4Feb 20, 2026 18:195,92877,509,84746,194,0003,012,0002,273,280
5Feb 20, 2026 18:195,96073,365,42045,429,0004,038,0002,318,336
6Feb 20, 2026 18:196,02774,760,27547,025,0003,001,0002,322,432