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 25, 2026 01:50Victor MerckléVictor MerckléScore: 4,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:514,06742,179,36332,646,0001,113,0002,117,632stderr
2Aug 25, 2026 01:514,07242,168,07232,731,0001,070,0002,117,632stderr
3Aug 25, 2026 01:514,07242,140,06932,672,0001,127,0002,117,632stderr
4Aug 25, 2026 01:514,08042,942,50632,706,0001,166,0002,117,632stderr
5Aug 25, 2026 01:514,08742,589,97232,856,0001,068,0002,117,632stderr
6Aug 25, 2026 01:514,09643,046,92232,912,0001,087,0002,117,632stderr
7Aug 25, 2026 01:514,11742,504,38133,096,0001,082,0002,117,632stderr
8Aug 25, 2026 01:514,15942,926,35333,446,0001,076,0002,117,632stderr
9Aug 25, 2026 01:514,18643,126,13233,731,0001,018,0002,117,632stderr