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 1, 2026 12:32George SeabridgeGeorge SeabridgeScore: 10,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:3210,25495,127,55684,026,0001,090,0002,117,632
2Aug 1, 2026 12:3210,26595,203,91184,131,0001,076,0002,113,536
3Aug 1, 2026 12:3210,27195,220,39884,167,0001,088,0002,113,536
4Aug 1, 2026 12:3210,30195,471,55084,321,0001,180,0002,113,536
5Aug 1, 2026 12:3210,55498,255,61786,456,0001,146,0002,113,536
6Aug 1, 2026 12:3211,534105,698,88794,648,0001,089,0002,113,536
7Aug 1, 2026 12:3211,551105,822,25494,785,0001,093,0002,113,536
8Aug 1, 2026 12:3211,575106,101,84894,982,0001,091,0002,113,536
9Aug 1, 2026 12:3211,594106,266,31595,145,0001,093,0002,113,536