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 listMay 21, 2025 21:04vahookvahookScore: 4,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2025 21:044,41466,830,84132,567,0004,070,0002,273,280
2May 21, 2025 21:044,42063,021,62633,633,0003,057,0002,273,280
3May 21, 2025 21:044,43762,319,63832,847,0003,981,0002,437,120
4May 21, 2025 21:044,44061,778,44133,866,0002,988,0002,428,928
5May 21, 2025 21:044,45060,222,56134,943,0001,996,0002,273,280
6May 21, 2025 21:044,45964,248,68335,009,0002,000,0002,273,280
7May 21, 2025 21:044,49362,643,40733,260,0004,031,0002,273,280
8May 21, 2025 21:044,49568,326,05734,284,0003,025,0002,424,832
9May 21, 2025 21:044,49956,928,73435,322,0002,018,0002,273,280
10May 21, 2025 21:044,51161,289,12334,405,0003,035,0002,273,280
11May 21, 2025 21:044,65068,464,50435,547,0003,046,0002,424,832
12May 21, 2025 21:044,88465,587,21737,496,0003,040,0002,433,024