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 listSep 21, 2025 16:26sheryllynn24sheryllynn24Score: 9,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 16:269,322111,565,76275,367,0002,009,0002,498,560
2Sep 21, 2025 16:269,408107,301,88776,086,0002,002,0002,289,664
3Sep 21, 2025 16:269,464103,883,23576,541,0002,014,0002,506,752
4Sep 21, 2025 16:269,545101,529,59878,223,0001,002,0002,289,664
5Sep 21, 2025 16:269,565107,852,37778,382,0001,004,0002,289,664
6Sep 21, 2025 16:269,601113,155,53776,701,0002,988,0002,498,560