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 10, 2026 17:20Daniel MastalerzDaniel MastalerzScore: 8,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 17:208,44794,254,79267,106,0003,004,0002,318,336
2Feb 10, 2026 17:208,45296,647,61464,136,0006,012,0002,404,352
3Feb 10, 2026 17:208,45395,829,17964,144,0006,013,0002,310,144
4Feb 10, 2026 17:208,45493,774,71664,152,0006,014,0002,408,448
5Feb 10, 2026 17:208,45594,315,54266,170,0004,010,0002,383,872
6Feb 10, 2026 17:208,45795,696,88565,183,0005,014,0002,510,848
7Feb 10, 2026 17:208,46993,559,91967,283,0003,012,0002,301,952
8Feb 10, 2026 17:208,50098,149,29665,514,0005,039,0002,293,760
9Feb 10, 2026 17:208,507100,301,97166,570,0004,034,0002,400,256
10Feb 10, 2026 17:208,64597,685,83068,765,0002,989,0002,498,560
11Feb 10, 2026 17:208,64694,681,92870,764,000996,0002,400,256
12Feb 10, 2026 17:208,64999,862,82068,795,0002,991,0002,404,352