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 listDec 10, 2025 04:25Thomas McClaveThomas McClaveScore: 273,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2025 04:25273,1032,290,595,2292,168,763,00097,989,0002,428,928
2Dec 10, 2025 04:25273,1952,296,362,7932,166,544,000100,978,0002,326,528
3Dec 10, 2025 04:25273,2232,295,818,1642,165,761,000101,988,0002,326,528
4Dec 10, 2025 04:25273,2652,293,957,0662,164,139,000103,958,0002,424,832
5Dec 10, 2025 04:25273,3122,297,873,0702,176,507,00091,979,0002,326,528
6Dec 10, 2025 04:25273,3322,297,110,1602,179,705,00088,947,0002,326,528
7Dec 10, 2025 04:25273,4722,296,860,5022,178,868,00090,952,0002,326,528
8Dec 10, 2025 04:25273,6932,303,338,8302,158,723,000112,933,0002,326,528
9Dec 10, 2025 04:25274,1362,306,564,7792,165,365,000109,967,0002,326,528