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 29, 2025 14:44Josu San MartinJosu San MartinScore: 28,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:4428,610267,041,736236,463,0001,001,0002,404,352
2Dec 29, 2025 14:4428,613263,719,889237,491,00002,273,280
3Dec 29, 2025 14:4428,705264,533,907236,249,0002,002,0002,396,160
4Dec 29, 2025 14:4428,722266,456,867238,395,00002,404,352
5Dec 29, 2025 14:4428,724260,821,867237,405,0001,001,0002,400,256
6Dec 29, 2025 14:4428,742273,427,474238,562,00002,273,280
7Dec 29, 2025 14:4428,763267,666,204237,738,000998,0002,387,968
8Dec 29, 2025 14:4428,778260,361,034237,855,000999,0002,392,064
9Dec 29, 2025 14:4428,796261,745,482237,008,0002,000,0002,396,160