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 7, 2025 05:38limanjun99limanjun99Score: 46,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2025 05:3846,823418,065,502326,689,00061,941,0002,260,992
2Jun 7, 2025 05:3846,846419,916,397325,853,00062,971,0002,256,896
3Jun 7, 2025 05:3846,851415,427,793327,886,00060,978,0002,363,392
4Jun 7, 2025 05:3846,862420,135,711329,965,00058,993,0002,367,488
5Jun 7, 2025 05:3846,879416,216,901342,081,00047,011,0002,510,848
6Jun 7, 2025 05:3846,961420,304,939329,812,00059,965,0002,363,392
7Jun 7, 2025 05:3846,983413,125,476327,966,00061,993,0002,359,296
8Jun 7, 2025 05:3847,102415,209,510334,952,00055,992,0002,355,200
9Jun 7, 2025 05:3847,785423,818,575319,691,00076,925,0002,363,392