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 listMar 5, 2026 00:35olliecrowolliecrowScore: 5,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 00:355,42172,266,19541,999,0002,999,0002,433,024
2Mar 5, 2026 00:425,43169,513,72843,075,0002,003,0002,482,176
3Mar 5, 2026 00:425,44268,072,53442,157,0003,011,0002,473,984
4Mar 5, 2026 00:425,45273,758,74241,229,0004,022,0002,301,952
5Mar 5, 2026 00:355,47675,972,77943,433,0002,020,0002,355,200
6Mar 5, 2026 00:355,52271,835,68543,843,0001,992,0002,449,408
7Mar 5, 2026 00:355,61472,092,55943,560,0003,039,0002,277,376
8Mar 5, 2026 00:355,76781,849,05244,872,0002,991,0002,265,088
9Mar 5, 2026 00:355,76975,193,14044,888,0002,992,0002,486,272
10Mar 5, 2026 00:425,77179,559,32146,899,000997,0002,371,584
11Mar 5, 2026 00:425,80674,884,03944,171,0004,015,0002,433,024
12Mar 5, 2026 00:425,80675,028,91245,179,0003,011,0002,453,504