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 listMar 29, 2026 08:13Danylo MocherniukDanylo MocherniukScore: 56,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:1356,614492,822,987467,896,0001,999,0002,506,752
2Mar 29, 2026 08:1356,628492,659,632469,014,0001,000,0002,281,472
3Mar 29, 2026 08:1356,642494,885,233469,126,0001,000,0002,281,472
4Mar 29, 2026 08:1356,642497,563,538468,131,0002,000,0002,281,472
5Mar 29, 2026 08:1356,644493,807,732468,143,0002,000,0002,281,472
6Mar 29, 2026 08:1356,674499,346,219469,395,0001,000,0002,281,472
7Mar 29, 2026 08:1356,678499,886,402469,427,0001,000,0002,510,848
8Mar 29, 2026 08:1356,691494,576,045469,534,000999,0002,281,472
9Mar 29, 2026 08:1356,698495,254,157469,590,0001,001,0002,506,752