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 14, 2026 13:54Yuriy LyfenkoYuriy LyfenkoScore: 8,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 13:547,95890,160,14763,053,0003,002,0002,469,888
2Mar 14, 2026 13:548,04793,796,36262,807,0003,987,0002,465,792
3Mar 14, 2026 13:548,06092,481,34463,902,0002,995,0002,482,176
4Mar 14, 2026 13:548,06293,036,70964,914,0001,997,0002,494,464
5Mar 14, 2026 13:548,08393,873,75263,087,0004,005,0002,494,464
6Mar 14, 2026 13:548,29798,687,89163,874,0004,990,0002,297,856
7Mar 14, 2026 13:548,33590,453,81266,174,0003,007,0002,363,392
8Mar 14, 2026 13:548,49191,223,23467,458,0003,020,0002,367,488
9Mar 14, 2026 13:549,06894,819,10373,256,0002,007,0002,396,160