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 listJan 31, 2026 15:07olliecrowolliecrowScore: 7,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 15:076,87584,714,95455,064,0002,002,0002,281,472
2Jan 31, 2026 15:076,89284,077,00953,192,0004,014,0002,433,024
3Jan 31, 2026 15:076,93982,145,15356,585,0001,010,0002,326,528
4Jan 31, 2026 15:077,18385,841,10458,605,0001,010,0002,494,464
5Jan 31, 2026 15:077,22186,430,33657,940,0001,997,0002,310,144
6Jan 31, 2026 15:077,32391,772,44854,801,0005,978,0002,273,280