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 13, 2026 21:07Daniel MastalerzDaniel MastalerzScore: 7,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:077,38186,243,13757,248,0004,017,0002,269,184
2Feb 13, 2026 21:077,39086,186,04355,308,0006,033,0002,265,088
3Feb 13, 2026 21:077,39386,031,60156,335,0005,029,0002,326,528
4Feb 13, 2026 21:077,39586,686,55158,362,0003,018,0002,269,184
5Feb 13, 2026 21:077,39990,016,68958,392,0003,020,0002,326,528
6Feb 13, 2026 21:077,40895,205,59356,448,0005,040,0002,265,088
7Feb 13, 2026 21:077,41891,328,40956,524,0005,046,0002,326,528
8Feb 13, 2026 21:077,42989,756,69655,694,0005,967,0002,289,664
9Feb 13, 2026 21:077,43693,382,10956,739,0004,977,0002,322,432
10Feb 13, 2026 21:077,54587,993,72261,610,0001,010,0002,269,184
11Feb 13, 2026 21:077,55088,872,94459,681,0002,984,0002,273,280
12Feb 13, 2026 21:077,56292,061,91461,771,000996,0002,269,184