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 16, 2026 23:13Tomislav TunkovicTomislav TunkovicScore: 225,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:16225,8511,885,221,0351,871,566,0003,001,00045,056
2Aug 17, 2026 05:16225,8561,883,566,9041,871,601,0003,005,00045,056
3Aug 17, 2026 05:16225,8651,883,847,5521,871,683,0003,004,00045,056
4Aug 17, 2026 05:16225,8721,883,613,7831,871,741,0003,003,00045,056
5Aug 17, 2026 05:16225,8731,883,517,8461,871,751,0003,001,00045,056
6Aug 17, 2026 05:16225,8741,883,617,7271,871,756,0003,001,00045,056
7Aug 17, 2026 05:16225,8831,883,638,0041,871,759,0003,076,00045,056
8Aug 17, 2026 05:16225,8831,884,290,7511,871,830,0003,004,00045,056
9Aug 17, 2026 05:16225,8831,884,349,8181,871,704,0003,130,00045,056