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 20:06Daniel MastalerzDaniel MastalerzScore: 6,043Success
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 20:066,02876,762,69346,032,0004,002,0002,269,184
2Feb 19, 2026 20:066,02974,069,84046,035,0004,003,0002,265,088
3Feb 19, 2026 20:066,03370,387,51646,070,0004,006,0002,326,528
4Feb 19, 2026 20:066,03371,256,79546,067,0004,005,0002,326,528
5Feb 19, 2026 20:066,04176,916,98746,126,0004,011,0002,306,048
6Feb 19, 2026 20:066,04276,959,52546,134,0004,011,0002,326,528
7Feb 19, 2026 20:066,04384,552,34247,145,0003,009,0002,265,088
8Feb 19, 2026 20:066,04677,296,85547,171,0003,010,0002,265,088
9Feb 19, 2026 20:066,05275,725,39146,217,0004,018,0002,293,760
10Feb 19, 2026 20:066,12678,944,55846,861,0003,988,0002,269,184
11Feb 19, 2026 20:066,13072,695,07447,886,0002,992,0002,322,432
12Feb 19, 2026 20:066,14874,203,72847,027,0004,002,0002,322,432