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 listJun 27, 2025 10:18Elijah KinElijah KinScore: 366,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2025 10:18366,0893,062,070,5512,965,575,00072,964,0002,281,472
2Jun 27, 2025 10:18366,5013,070,544,4552,977,977,00063,978,0002,510,848
3Jun 27, 2025 10:18366,5763,067,573,9982,981,607,00060,971,0002,281,472
4Jun 27, 2025 10:18366,6093,067,758,5162,970,879,00071,972,0002,289,664
5Jun 27, 2025 10:18366,7333,071,249,7312,980,906,00062,976,0002,281,472
6Jun 27, 2025 10:18367,0313,069,389,3832,978,393,00067,963,0002,281,472
7Jun 27, 2025 10:18367,1753,071,538,8662,960,592,00086,958,0002,506,752
8Jun 27, 2025 10:18369,5573,094,226,9292,999,358,00067,962,0002,510,848
9Jun 27, 2025 10:18377,8253,163,113,5633,062,972,00072,975,0002,281,472