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 listSep 24, 2026 05:22wnwnScore: 3,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:223,31236,185,96926,487,0001,010,0002,113,536
2Sep 24, 2026 05:223,32536,321,80926,593,0001,007,0002,113,536
3Sep 24, 2026 05:223,32636,367,37026,604,0001,003,0002,113,536
4Sep 24, 2026 05:223,33736,441,22226,665,0001,037,0002,113,536
5Sep 24, 2026 05:223,33936,458,02026,686,0001,030,0002,113,536
6Sep 24, 2026 05:223,34036,520,77126,691,0001,038,0002,113,536
7Sep 24, 2026 05:223,50138,462,35728,053,0001,009,0002,113,536
8Sep 24, 2026 05:223,50537,879,52228,096,0001,001,0002,113,536
9Sep 24, 2026 05:223,53838,805,72028,325,0001,045,0002,113,536