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 listAug 26, 2026 22:15Victor MerckléVictor MerckléScore: 3,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:163,73940,227,09629,906,0001,128,0002,113,536
2Aug 26, 2026 22:163,75239,551,26930,015,0001,133,0002,113,536
3Aug 26, 2026 22:163,76140,208,26930,076,0001,148,0002,113,536
4Aug 26, 2026 22:163,76639,491,12230,099,0001,166,0002,113,536
5Aug 26, 2026 22:163,77640,982,67930,251,0001,091,0002,113,536
6Aug 26, 2026 22:163,79039,748,98730,284,0001,176,0002,113,536
7Aug 26, 2026 22:163,81139,948,42230,504,0001,130,0002,113,536
8Aug 26, 2026 22:163,94040,932,40231,656,0001,049,0002,113,536
9Aug 26, 2026 22:163,94241,778,55331,567,0001,157,0002,113,536