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 listApr 28, 2026 04:42Charles CabergsCharles CabergsScore: 13,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 04:4213,275128,917,265109,184,0001,001,0002,367,488
2Apr 28, 2026 04:4213,278124,834,287109,214,0001,001,0002,441,216
3Apr 28, 2026 04:4213,296124,930,845109,355,0001,003,0002,445,312
4Apr 28, 2026 04:4213,578131,712,919110,705,0001,994,0002,461,696
5Apr 28, 2026 04:4213,579128,688,080110,718,0001,994,0002,359,296
6Apr 28, 2026 04:4213,588130,554,865110,788,0001,996,0002,363,392
7Apr 28, 2026 04:4213,588131,242,868110,791,0001,996,0002,363,392
8Apr 28, 2026 04:4213,588129,971,604110,788,0001,996,0002,371,584
9Apr 28, 2026 04:4213,604128,957,592110,919,0001,998,0002,363,392