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 16:20Daniel MastalerzDaniel MastalerzScore: 5,830Success
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 16:205,74076,086,44444,601,0003,041,0002,523,136
2Feb 20, 2026 16:205,74176,087,92944,612,0003,041,0002,330,624
3Feb 20, 2026 16:205,76770,890,43643,880,0003,989,0002,326,528
4Feb 20, 2026 16:205,83077,120,83445,361,0003,024,0002,289,664
5Feb 20, 2026 16:205,83173,595,95844,364,0004,033,0002,310,144
6Feb 20, 2026 16:205,83574,019,01246,416,0002,018,0002,318,336