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 7, 2026 08:45wnwnScore: 3,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:453,38644,340,53427,031,0001,073,0002,490,368
2May 7, 2026 08:453,39742,481,94827,104,0001,095,0002,486,272
3May 7, 2026 08:453,54545,804,35728,342,0001,084,0002,490,368
4May 7, 2026 08:453,54645,243,69628,314,0001,125,0002,490,368
5May 7, 2026 08:453,54945,448,12128,400,0001,058,0002,494,464
6May 7, 2026 08:453,55344,063,72628,405,0001,088,0002,486,272
7May 7, 2026 08:453,56543,466,24828,516,0001,078,0002,486,272
8May 7, 2026 08:453,56945,811,96428,516,0001,109,0002,490,368
9May 7, 2026 08:453,58646,739,15428,679,0001,086,0002,486,272