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 31, 2026 00:03Josu San MartinJosu San MartinScore: 4,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:174,25843,730,86334,291,0001,051,0002,113,536
2Aug 31, 2026 00:174,25843,762,73034,306,0001,038,0002,113,536
3Aug 31, 2026 00:174,25943,875,11734,304,0001,046,0002,113,536
4Aug 31, 2026 00:174,26943,879,23134,402,0001,037,0002,113,536
5Aug 31, 2026 00:174,28044,076,80334,464,0001,065,0002,113,536
6Aug 31, 2026 00:174,28443,997,16634,425,0001,133,0002,113,536
7Aug 31, 2026 00:174,29744,061,76034,550,0001,117,0002,113,536
8Aug 31, 2026 00:174,31744,273,78334,708,0001,126,0002,113,536
9Aug 31, 2026 00:174,31944,224,71234,733,0001,118,0002,113,536