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 listJul 31, 2026 16:27George SeabridgeGeorge SeabridgeScore: 8,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 16:278,76083,151,18971,570,0001,143,0002,117,632
2Jul 31, 2026 16:278,76482,871,25571,610,0001,136,0002,117,632
3Jul 31, 2026 16:278,76982,740,97371,637,0001,149,0002,117,632
4Jul 31, 2026 16:278,77082,803,38571,650,0001,144,0002,117,632
5Jul 31, 2026 16:278,77082,830,94571,655,0001,140,0002,117,632
6Jul 31, 2026 16:278,78182,935,75571,741,0001,147,0002,117,632
7Jul 31, 2026 16:278,81083,076,21871,990,0001,137,0002,117,632
8Jul 31, 2026 16:278,82783,274,78072,129,0001,140,0002,117,632
9Jul 31, 2026 16:278,83084,621,87972,147,0001,143,0002,117,632