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 listMay 14, 2026 07:46Victor MerckléVictor MerckléScore: 58,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:4658,675494,234,991486,001,0001,004,0002,117,632stderr
2May 14, 2026 07:4658,678496,515,101486,030,0001,004,0002,117,632stderr
3May 14, 2026 07:4658,684495,847,423486,076,0001,004,0002,117,632stderr
4May 14, 2026 07:4658,687494,329,197486,106,0001,004,0002,117,632stderr
5May 14, 2026 07:4658,687496,060,175486,098,0001,005,0002,117,632stderr
6May 14, 2026 07:4658,688494,438,522486,110,0001,004,0002,117,632stderr
7May 14, 2026 07:4658,699494,798,402486,203,0001,003,0002,117,632stderr
8May 14, 2026 07:4658,700495,564,897486,205,0001,006,0002,117,632stderr
9May 14, 2026 07:4658,701496,503,695486,214,0001,005,0002,117,632stderr