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 27, 2026 08:31Victor MerckléVictor MerckléScore: 6,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 08:326,04659,840,90349,098,0001,086,0002,113,536
2Aug 27, 2026 08:326,05058,537,11749,142,0001,076,0002,113,536
3Aug 27, 2026 08:326,05358,534,87049,172,0001,070,0002,113,536
4Aug 27, 2026 08:326,08358,913,49349,375,0001,114,0002,113,536
5Aug 27, 2026 08:326,13459,557,85749,840,0001,076,0002,113,536
6Aug 27, 2026 08:326,16459,527,63750,107,0001,061,0002,113,536
7Aug 27, 2026 08:326,17059,486,71450,145,0001,068,0002,113,536
8Aug 27, 2026 08:326,17259,664,02550,051,0001,180,0002,113,536
9Aug 27, 2026 08:326,18159,614,29950,195,0001,108,0002,113,536