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 listMar 31, 2026 12:30Yuriy LyfenkoYuriy LyfenkoScore: 4,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 12:304,51760,039,28836,477,0001,013,0002,469,888
2Mar 31, 2026 12:304,53767,431,44836,640,0001,017,0002,535,424
3Mar 31, 2026 12:304,59362,429,15736,119,0002,006,0002,273,280
4Mar 31, 2026 12:304,65964,153,70837,650,0001,017,0002,273,280
5Mar 31, 2026 12:304,67364,663,63736,798,0001,989,0002,310,144
6Mar 31, 2026 12:304,67867,772,70236,839,0001,991,0002,535,424
7Mar 31, 2026 12:304,67965,016,29337,837,000995,0002,535,424
8Mar 31, 2026 12:304,67969,230,89736,841,0001,991,0002,535,424
9Mar 31, 2026 12:304,68665,913,57336,898,0001,994,0002,310,144