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 listJan 3, 2025 07:09Rohan KapurRohan KapurScore: 402,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 07:09402,9413,378,344,7183,272,442,00071,965,0002,285,568
2Jan 3, 2025 07:09402,9963,372,674,9323,282,887,00061,978,0002,375,680
3Jan 3, 2025 07:09404,0803,389,291,9183,288,902,00064,958,0002,281,472