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 4, 2026 09:37LatentSearchLatentSearchScore: 8,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 09:378,13575,998,74666,326,0001,198,0002,117,632
2Aug 4, 2026 09:378,14275,982,53766,426,0001,160,0002,117,632
3Aug 4, 2026 09:378,14676,077,50966,444,0001,174,0002,117,632
4Aug 4, 2026 09:378,14676,152,83066,450,0001,170,0002,117,632
5Aug 4, 2026 09:378,15176,095,43066,506,0001,153,0002,117,632
6Aug 4, 2026 09:378,15576,182,49666,480,0001,211,0002,117,632
7Aug 4, 2026 09:378,15776,093,59666,528,0001,176,0002,117,632
8Aug 4, 2026 09:378,16276,245,14766,732,0001,014,0002,117,632
9Aug 4, 2026 09:378,17076,288,64766,609,0001,205,0002,117,632