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 23, 2026 17:22Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:233,74139,854,56429,933,0001,123,0002,117,632stderr
2Aug 23, 2026 17:233,75439,579,31229,993,0001,171,0002,117,632stderr
3Aug 23, 2026 17:233,75539,554,03030,047,0001,124,0002,117,632stderr
4Aug 23, 2026 17:233,77639,687,26030,232,0001,114,0002,117,632stderr
5Aug 23, 2026 17:233,78839,766,68330,376,0001,065,0002,117,632stderr
6Aug 23, 2026 17:233,79443,258,59730,413,0001,083,0002,117,632stderr
7Aug 23, 2026 17:233,93341,074,08531,634,0001,017,0002,117,632stderr
8Aug 23, 2026 17:233,94341,183,71331,679,0001,052,0002,117,632stderr
9Aug 23, 2026 17:234,06242,073,55232,646,0001,076,0002,117,632stderr